Design an algorithm that finds the number of ways in which you can traverse $N$ meters by doing jumps of $1$, $2$, $3$, $4$, or $5$ meter lengths.

On a $M\times N$ board, some cells are occupied. Find the size of the largest square of unoccupied cells.