I will upvote it thanks

6. The eccentricity of a vertex v is the length of the shortest path from v to the vertex that is furthest from v. (a) For an unweighted graph, describe an Om + n) time algorithm that finds the eccentricity of a given vertex v. Note that m= E and n = IVI. (b) For a weighted graph, describe an Om Ign) time algorithm that finds the eccentricity of a given vertex u. (c) The diameter of a graph is the maximum eccentricity of any vertex. For a weighted graph G, describe an algorithm that finds the diameter of G. What is the worst-case time complexity of your algorithm