1) Given the graph below, assume we need to form a spanning tree. Which pair of edges, if removed, would form a spanning tree? Select one or more! removing the edge a-d and the edge a-c would form a spanning tree removing the edge b-d and the edge b-c would form a spanning tree removing the edge a-d and the edge d-c would form a spanning tree removing the edge b-d and the edge a-c would form a spanning tree 2) How many distinct spanning trees can be found in the graph below? e2 e4