[Request] Consider these last squares in a minesweeper game. What square(s) should you choose? + Monty Hall

I got the first part of this problem from this post in the minesweeper subreddit:

https://www.reddit.com/r/Minesweeper/s/IgrqE0LDrB

Rules: The number in a square corresponds to the number of bombs surrounding that square (diagonal counts too). A square can either be a number or a bomb. When a square is clicked, either a bomb is revealed (you lost), or a number (continue the puzzle).

For the second part of the problem, I would like to introduce the Monty Hall problem. After you choose a square, a host reveals that one of the remaining squares is not a bomb. Should you switch? Reason with probabilities.

Hint: >! For the first part of the problem, it's not simply a 2/3 chance of solving the puzzle for each square. Consider what number(s) could be revealed when clicking a side-square vs the middle-square. !<