The statement contains 5 parks, all of which are connected to at least one other park. This means that we're not counting paths that may connect a park directly to itself. This means that the most paths possible per park is 4.
If M does not connect to J (and vice versa) this means that neither M nor J can have 4 paths. To have 4 paths they'd have to have connect to all other parks. The prohibition from M connecting to J means that they cannot connect to all other parks, thereby limiting M and J to a maximum of 4 each.
Since all parks have at least one connection, M > N > K means (assuming we're not dealing with fractional paths) means that M=3, N=2, K=1.
If N is connected to 2 parks, then the correct answer to question #2 cannot possibly be C, as C has 3 connections.
If this is incorrect, I would very much appreciate knowing why.