Assuming that you have an infinite chessboard as we talked in the class for a puzzle. Now, the king piece of the chess game can move to any neighboring square horizontally and vertically. However, the king cant move to any neighboring square diagonally.

(a) How many different squares can the king be after one move?

(b) How about the two and three moves?

(c) Based on the results above, present a formula for the general number n moves.