1. a. Suppose, a cell phone customer care center categorizes their customer under 20 different labels (0-19), where the customers holding larger labels are given higher priority. Consider at a particular instance of time, 10 customers arrive in order with the priority labels as follows: 5, 13, 4, 12, 14, 0, 10, 1, 8, 12, and 2. Now build a Binary Heap using the priority number. b. Now delete the top three priority customers from the heap and perform necessary operations to rebuild the heap after deletion. 2. Construct the minimum spanning tree for the following graph. Also compute the weight. Show the detailed steps. 5 6 2 5 E