The diameter of an undirected unweighted graph G, denoted by diam (G), is the maximum distance between any pair of nodes in G. Equivalently, it is the longest of the shortest paths between all pairs of nodes. (a) A related quantity is the average pairwise distance in G, denoted by apd(G), and defined distance(u, v) as (u, v) EV apd(G)= (2) i. (10 points) Give the simplest graph you can for which diam (G) apd(G). ii. (15 points) Prove or disprove that there exists a positive constant c such that for all connected graphs diam (G) apd(G) c. Activate Window