Kindly note that this is a general data structures and algorithm question which does not require solution in any specific programming language. The solution must be presented in PSEUDO-CODE only without using language specific functions.

(a) (b) Give a definition of the distance between two vertices in a graph. (1 marks) Let G be a graph with at least 3 vertices. The two vertices u and v of G are not adjacent. All other pairs of vertices are adjacent. What is the distance between u and v? 5. (2 marks) (c) Let P be a path of k vertices. What is the distance between the first and the last vertices of P? (2 marks) (d) The diameter of a graph G is the largest distance between two vertices of G To compute the diameter, we could calculate the distances between each pair of vertices and choose the largest distance. Determine the diameters of graphs F, G, H below. (5 marks) (e) Let G be a graph with vertices 0, , n-1, n > 2. Suppose that we have a function Compute Distance and j. Write an algorithm that uses this function to print the diameter of G and also prints a pair of vertices for which the distance between them equals the diameter. Briefly justify the correctness of this algorithm. (10 marks) (i,j) that returns the distance between verticesi