*****: ****** ********************* Consider the following graph. Add three edges weight according to your Reg No. e.g. 19-A-880 has last digit 0, 2nd last digit 8 and 3rd last digit 8. Add the required number as shown in the graph if any digit is zero. 3nd Last digit of your arid number, add 3 if its 0 12 A 20 8 F Last digit of your arid number, add 1 if its 0 11 21 H) 2nd Last digit of your arid number, add 2 if its 0 Apply kruskal algorithm on the above graph to compute Minimum Spanning Tree. Consider node A as the starting vertex. Detailed steps of dry run are required in your solution. Solve all steps * ** ** ** 9. B.