(a) In class we learned one algorithmic way to create a spanning tree TG with V(T)=V(G) : iteratively delete one edge that is part of a cycle until no cyles are left. Using this cycle-removal algorithm, find spanning trees T of the two graphs depicted below. (b) Read Section 3.2 in the Verstraete lecture notes, and understand how to construct a spanning tree using breadth-first-search (which we only implicitly touched upon in class). Using this breadth-first algorithm, find spanning trees T of the two graphs depicted below (starting with vertex 1 and a, respectively; if there are ties, prioritize vertices with smaller labels). (a) Graph G (D) viapil in