** I need u to solve just the question number 3 but the answer should be step by step ,,

this is my second post today to solve it and the last expert dose not solve it step by step help me

1. Consider the following undirected, weighted graph (CLO.4): G 2 N 12 B B D 7 5 9 2 F 3 2 3 E 10 Calculate the single-source shortest paths (Dijkstra's algorithm) from A to every other vertex. Show your step in the table below 3 points) Vertex Distance Path 0 A B D E F G 3. Write the pseudo code which represent Minimum cost spanning tree for Prim's algorithm using heaps data structure (use the graph in Question 1), analyze the time complexity (show your steps), compare your result with the time complexity we explained in the class room. (CLO.1,3) (4 points)