should be written in Python

5. (a) (b) Give a definition of the distance betweon two vertices in a gra Let G be a graph with a adjacent. u and v? t least 3 vertices. The two vertices u and v of G are not All other pairs of vertices are adjacent. What is the distance between (2 marks) (c) Let P be a path of k vertices. What is the distance between the first and the (2 marks) last vertices of P? (d) The diamcter 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 (5 marks) F. G. H below (c) L.et. G be a graph with vertices 0,... ,2. Suppose that we have a function Compute Distance(i,) that returns the distance between vertices i 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 algorith.(10 marks)