2. Consider the following graph G: 10 17 12 1 (a) (5 pts) Write down the adjacency-list and adjacency-matrix representations of G. (b) (10 pts) Write down the order in which BFS and DFS would traverse the vertices of G. Assume that you start at vertex s and that you visit the neighbors of a vertex in alphabetical order (i.e., a before b, and so on.) (c) (5 pts) Write down a cut C of G and identify which edges) of C are part of the MST (d) (5 pts) Is the MST of G unique? Why or why not? (Justify your answer.)