Discrete math. I will thumb up if the answer is correct.

Grid Grove is a neighborhood, with houses organized inmrows ofncolumns. Housesthat are closest to each other are connected by a walkway (note that this organization followsthe definition of a grid graph given in lecture). Assume thatm, n2. As follows from lecture,Grid Grove hasmnhouses and 2mnmnwalkways. It is also possible to walk to anyhouse from any other house through some sequence of walkways. To save money, the landlordswant to get rid of some walkways. CalculateD, the maximum number of walkways that can beremoved from the neighborhood without disconnecting it. Justify your answer. Then describe(informally)whichDwalkways of the neighborhood can be removed (there is more than onesuch set ofDwalkways).

(10 pts] Grid Grove is a neighborhood, with houses organized in m rows of n columns. Houses that are closest to each other are connected by a walkway (note that this organization follows the definition of a grid graph given in lecture). Assume that min > 2. As follows from lecture, Grid Grove has mn houses and 2mm - m - n walkways. It is also possible to walk to any house from any other house through some sequence of walkways. To save money, the landlords want to get rid of some walkways. Calculate the maximum mumber of walkways that can be removed from the neighborhood without disconnecting it. Justify your answer. Then describe (informally) which D walkways of the neighborhood can be removed (there is more than one such set of D walkways)