Given an undirected graph G and a vertex x in G, write a function in C called eccentricity() that returns the maximum distance from x to any other vertex y in G using only the Graph ADT functions defined for project 2. The eccentricity of x is defined as the maximum distance from x to any other vertex. The function takes a Graph G and integer x as parameters and has no preconditions.

1. (20 Points) Given a connected (undirected) graph G, and a vertex xV(G), the eccentricity of x in
G is the maximum possible distance from x to any other vertex yV(G), i.e.
eccentricity(x)=max{(x,y)yV(G)} Using only the Graph ADT functions defined in the project
description for pa2, write a client function in C with the heading inteccentricity(GraphG,intx)
that returns the eccentricity of x, for any x in the range 1xV(G). This function has no
preconditions.
Graph ADT operations (pa2): Graph newGraph (int n ); void freeGraph (Graph* pG ); int
getorder (Graph G); int getSize (Graph G); int getSource (Graph G ); int getParent (Graph G, int
u ); int getDist (Graph G, int u); void getPath (Iist L, Graph G, int u ); void makeNull (Graph G);
void addEdge (Graph G, int u, int v); void addArc (Graph G, int u, int v); void BFS (Graph G, int
s);