please do this under the process of C programming

(20 Points) Given a connected (undirected) graph G, the diameter of G is the maximum possible distance between any two vertices x and y in G, i.e. diameter(G)=max{(x,y)x,yV(G)} Using only the Graph ADT functions defined in the project description for pa2, write a client function with the heading int diameter (Graph G) Your function will compute and return the diameter of its input graph G