3 a On a 3x3 grid draw a path that starts in the center of a square in the corner of the grid and repeatedly moves from the center of one square to the center of an adjacent square without visiting any squares twice and such that every square in the grid is included For example the following is a path that meets these conditions What are the possible ending positions for a path drawn according to these rules What if you started from an edge square or the center square of the grid Explain b Repeat the above problem for a 4 x 4 grid e Can you describe what happens in general for an nxn grid where n is a positive integer