Question 1 (3 points) 011. Let T be a spanning tree of graph (3, Suppose the spanning tree T has 7 edges. How many vertices must there be in the graph G? YourAnswer: Answer Question 2 (3 points) Q12D. Assess whether the statement is true or false: The graph shown is not a tree. X 0 True 0 False Question 3 (5 points) Q15D. Consider the graph with the following vertices and edges: V:{a,b,c,d,e,f) E = lla, b), la, Cl. (a, dl, la, f}, lb, Cl, lb, 6}, lb, fi. lc, dl, {Ci flv {di 6}, id, fl] Which of the following sets of edges represent subgraphs of the graph that are spanning trees? (Select all that apply.) [_] {lay bl, {av Ci, {3, fly {by all (d, ell L] iib, f} (c, f), (d eii [7 (la, f}. lb. f}, in, f}, id, ei, id. fl] [7 (la, cl), {6. d}. id, 6}, id, fl} [3 Ha, bl. lb. c]. lb. e), (c. d}. it. fl} Question 4 (3 points) Q19B. Given the graph with the following Vertices and edges: V = la, b, c, d, e, f. g} E : ({a, bi, (a, Cl, ta, d}, (a, f}, {by C]. {b 6}. lb. fl, (E, d), (c, g}. (d. ell id. f}, if. all How many edges must be removed to form a spanning tree of the graph? &/ Question 5 (3 points) Q13. Suppose a connected graph. G, has 10 vertices. How many edges must there be in a spanning tree of the graph, G? YourAnswer: S