Name:________________________________________

Consider the following undirected graph:

1. (2 pts) Suppose Kruskal's minimum-spanning tree algorithm is applied to this graph. List the edges that are chosen for the MST, in the order they are chosen.
   
   
   
   
   
   
   
   
   
   
2. (2 pts) Suppose Prim's minimum-spanning tree algorithm is applied to this graph, starting with node s. List the edges that are chosen for the MST, in the order they are chosen.
   
   
   
   
   
   
   
   
   
3. (1 pt) True or False: Consider any undirected connected graph G = (V,E) with weights on the edges, where each weight is a member of the set {1,2,...,|V|}. Then the minimum spanning tree of G is guaranteed to be unique.