8. Consider the following graph: 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) Run bellman ford algorithm with node a as starting node. Assuming that order of edge relaxation is (a,b), (b,c), (a,c), (a,d), (d,c), (d,b), (c,b). you need to show all iterations and the distance array for each edge relaxation in each iteration.