Franklin the fly starts at the point $(0,0)$ in the coordinate plane. At each point, Franklin takes a step to the right, left, up, or down. After $2$ steps, how many different points could Franklin end up at?
After n steps.....he can reach ( n + 1)^2 lattice points (points with integer coordinates) = (2 + 1)^2 = 9
+1610 
