Please write in easily copy-able format Thank you!

Given the following Figure 1 with the values in the brackets represent distance between the vertices. AB (12) AC (3) AJ (13) BC (10) BD (2) BH (4) BL(25) CD (7) CJ (5) DH (20) EF (11) EJ (9) FG (15) FH (14) GH (6) HI (1) and the following algorithm: PRIM'S ALGORITHM: Let R be a symmetric, connected relation with a vertices. STEP 1. Choose a vertex v. of R. Let Vly) and E= 1). STEP 2. Choose a nearest neighbor v, of V that is adjacent to vv, EV, and for which the edge (vv) does not form a cycle with members of E. Add v, to V and add (v.) to E. Step 3. Repeat step 2 until El=-- 1. Then contains all n vertices of R, and contains the edges of a minimal spanning tree for R. End of Algorithm Question 1: Report on the steps to use Prim's algorithm to calculate a Minimum Spanning Tree (MST) starting from vertex A. Demonstrate the values mathematically using a table with appropriate labels (the format format is given below with the first row completed). Sketch the process of obtaining the figure to show the edges being traversed in the algorithm. Step 1 = Figure 1, Step 2 = Figure 2 etc. Then compute the total distance for the MST. (Max 2 A4 page) Step Neighbouring paths Path added to answer Distance 1. AJ (13) AC (3) 3 AC (3) AB (12) Total Distance for MST