Consider the following graph (Not to scale). 21 B A 10 E 7 12 3 8 D 9 Using the above weighted graph complete the following questions. a) Write down the weight matrix for the graph. b) How is the weight or adjacency matrix for a graph used in computing pro- grams or algorithms? c) Compute and draw the minimal spanning tree for the above graph. d) What is the total of the edge weights in the minimal spanning tree. e) Is the graph below a tree of the graph given at the start of the question. If not, explain why. 21 B A 10 E 7 12 8 8 D