Given Graph G shown below, answer the following three questions: 45 C 44 16 E B 49 31 G1 81 F H 30 62 D 20 K 7 50 First Question: Give the adjacency matrix of Graph Gi. Second Question: Give the following details of the minimum spanning tree (MST) of Graph G: 1. Draw an MST of Graph Gi. 2. Show the order of edges selected using Kruskal's Algorithm for finding the MST. 3. Show the order of edges selected using Prims Algorithm for finding the MST. Third Question: Find the lengths of all the shortest paths in Graph G starting at node A. (Only provide a table as shown below.) A B C D E F H I K