1. (8p) Find alphabetically (as discussed in class). Mark and label the tree edges as they are generated: (1).(2).(3)...and so on a breadth-first spanning tree of the given simple graph. Assume that the vertices are examined 2. (8p) Find a depth-first spanning tree of the given simple graph. Assume that the vertices are examined alphabeticall (as discussed in class). Mark and label the tree edges as they are generated: (1). (2). (3....and so on. 3. (6p) Use Prim's algorithm to find a minimum-weight spanning tree of the given weighted graph. Start at node A and label the tree edges as they are generated: (1), (2), (3) and so on. 10 12