Consider a grid of size m $\backslash$times n$.$ Each cell in the grid has either an $$x$$ or an $$o$.$ We like to find the largest square $($in terms of area$)$ in this grid, in which all the cells contain an $$x$($hint: Design a dynamic programming solution for this problem. Consider the function C$($i$,$ j$)$ which represents the side length of the largest square, where $($i$,$ j$)$ cell is the bottom$-$right$-$most corner cell of that square.$)$