8. (14 points) Consider the following graph b 2 1 4 d 3 3 a. (5 points) Give the adjacency matrix of the graph b. (3 points) What is the cost of the minimum spanning tree (MST) of this graph? c. (6 points) Suppose that a graph G(V, E) has an MST computed. How quickly can we update the MST if we add a new node and incident edges to G? Provide a strategy or an algorithm and evaluate its asymptotic complexity.