Ant

Chef has an $N\times N$ grid and an ant. The square at the $i^{th}$ row from top and $j^{th}$ column from left is numbered $(i,j)$ $(0\le i,j \lt N)$. The ant has to: - **Start** from the top-left corner $(0,0)$ - Move up, down, left, or right in one move - Visit **all** the squares of the grid (except $(0,0)$) **exactly** once - **Return** back to square $(0,0)$ Chef wants you to fill the gr