In the following graph, identify distances between each pair of vertices and write your answer in terms of a matrix. You may assume that
AA_(u)distance
(u,u)=0. How many entries of the matrix are required? For which pairs is the distance (
u,v) maximized? What is the maximum value? (8)
