1 (11] points) Answer the following questions. about the rooted tree illustrated below. a] Which vertex is the root? b) Which vertices are internal? c] Which vertices are leaves? cl] Which vertices are children of j? e] Which vertex is the parent of h? f) Which vertices are siblings of e? g] Which vertices are ancestors of g? h] Which vertices are descendants of c? 2 Consider the following simple graph with vertex A as the root and using alphabetical ordering. a] (5 points) Draw a spanning tree using a depthfirst search. b] (5 points) Draw a spanning tree using a breadthfirst search