Question 3.3 Use the breadth-first and depth-first search algorithm to find spanning trees of the graph in Figure 1.21, with the root of the tree at vi and the ordering of the vertices being (v1, v2, ..., vg). Show all your work. (a) Write down the height of each tree. (b) Write down the radius of the graph. (c) Write down the diameter of the graph. V3 U5 Figure 1.21: A graph with nine vertices