1. Develop an algorithm and implement it to get the minimum spanning tree for the following...

 

Transcribed Image Text:

1. Develop an algorithm and implement it to get the minimum spanning tree for the following graph using Kruskal's algorithm and Prim's algorithm. B نا 2 5 N D 2 F 7 9 2. Develop an algorithm and implement it, to sort the following list of numbers using Max - Heap data structure algorithms. {17, 90, 23, 86, 15, 34) Note: In the answer sheet, give algorithm, executable code, screen shot of the output obtained for each questions. 1. Develop an algorithm and implement it to get the minimum spanning tree for the following graph using Kruskal's algorithm and Prim's algorithm. B نا 2 5 N D 2 F 7 9 2. Develop an algorithm and implement it, to sort the following list of numbers using Max - Heap data structure algorithms. {17, 90, 23, 86, 15, 34) Note: In the answer sheet, give algorithm, executable code, screen shot of the output obtained for each questions.