Design an algorithm to find the center vertex of the graph, that has the minimum maximum distance to all the vertices. [A vertex is called the center vertex of graph, if we travel from this vertex to all the vertices, then maximum distance from this vertex to all the other vertices is minimum].After writing the algorithm, Derive Your algorithms time complexity.

In this graph if A is the selected vertex maximum distance to reach all is 4

In this graph if B is the selected vertex maximum distance to reach all is 3

In this graph if C is the selected vertex maximum distance to reach all is 2

In this graph if D is the selected vertex maximum distance to reach all is 3

In this graph if E is the selected vertex maximum distance to reach all is 3

In this graph if F is the selected vertex maximum distance to reach all is 3

In this graph if G is the selected vertex maximum distance to reach all is 4

We have to find this vertex C, having minimum maximum distance in graph.

General solution needed to solve the problem.

subject: Design and analysis of algorithms

B E ) C) F D G