Q.No.1. Given weighted graph, apply both Prim's and Kruskal Algorithm to find MST. Show all steps. Consider node 0 as source node. No credit for writing direct answer. Q.No.2. Build Min-Heap from the data given below and then sort the data. Show all steps. Q.No.3. Thief enters into the bank for robbery carrying a bag with 60KG capacity. He sees only 5 items with the following weights and values. In which order thief should pick items if he can take the fraction of any the items so that maximum gain can be achieved