Can someone help me solve this problem from Algorithhms 4th Edition by Robert Sedgewick, Kevin Wayne.

4.1.16 The eccentricity of a vertex v is the the length of the shortest path from that ver- tex to the furthest vertex from v. The diameter of a graph is the maximum eccentricity of any vertex. The radius of a graph is the smallest eccentricity of any vertex. A center is a vertex whose eccentricity is the radius. Implement the following API: public class GraphProperties GraphProperties (Graph G) constructor (exception ifG not connected) int eccentricity(int v) int diameterO int radius () int centerO eccentricity of v diameter of G radius of G a center ofG