Let G=K8, the complete graph on eight vertices. (a) Draw G and perform a breadth-first search to find a spanning tree. You may pick any vertex as your starting vertex but you must label it in your graph. (b) Draw G again and perform a depth-first search to find a spanning tree. You may pick any vertex as your starting vertex but you must label it in your graph. (c) How are the two spanning trees form (a) and (b) different? (d) If the spanning tree represents the plans for an irrigation system (with starting vertex as the source, other vertices as where the water is going, fnd edges as pipes carrying the water), which spanning tree will distribute the water from the sources to the outputs in the most efficient way? Provide explanation