c. Find the diameter of the graph by **rooting the tree, and a recursive call from the root asking for the diameter of each subtree hanging from each of its child. *Diameter is defined as the longest path (number of edges) between any two nodes Vi, Vj; EV. ** Rooting a tree is choosing a vetrex in the tree to be called a root. The neighbors of the root are called the children of the root. Recursively, the child is now a root for the fragment of the tree it resides in, after the removal of the root from the tree.