Please i need the full answer in less than 40 minutes please

Given the graph below, answer the following questions: 13 27 E B 22 G1 31 18 29 F H 82 62 D 51 K 77 45 a) (6 points) Give the adjacency list of Graph G. b) Give the following details of the minimum spanning tree (MST) of Graph Gi: 1. (8 points) Draw an MST of Graph G. 2. (6 points) Show the order of edges selected using Kruskal's Algorithm for finding the MST. 3. (6 points) Show the order of edges selected using Prim's Algorithm for finding the MST. c) (10 points) Find the lengths of all the shortest paths in Graph G starting at node A. (Only provide a table as shown below.) B D F H K 1