1. Give an adjacency-list representation for a complete binary tree on 7 vertices. Give an equivalent adjacency - matrix representation. Assume that vertices are numbered from 1 to 7 as in a binary heap?
2. Is Minimum Spanning Tree for an Undirected connected graph unique, Justify your answer?
3. Modify the kruskal's algorithm using priority queue data structure?
b) There are two well known algorithm for finding minimum spanning trees. Point out the difference between Prim's algo and kruskal algo in term of construction in Minimum Spanning tree?