Consider a 2-dimensional mesh with n^2 nodes. The shortest distance that a message travels in the mesh is 1 link; the longest distance is 2(n-1) link. What is the average distance a message needs to travel from a corner node to anyother node, if all possible destination nodes are equally likely? you must prove your result