A general mn grid graph has m rows of n vertices with vertices closest to each other connected by an edge. Assume m, n 2. Recall that this graph has mn vertices and 2mnmn edges. Calculate D, the maximum number of edges that can be deleted from this graph without disconnecting it.

Please help with this and do not hand write! thanks!