(12 total points) (CAUTION: You are NOT asked to do any sorting here.) A binary tree is given below. You are to first transform the binary tree into a (max) heap using the more efficient method discussed in class (when covering heapsort)- must show working.(4 points 6. (show working on given diagram below) (draw resulting heap in dashed box below) 25 26 24 27 5 (15 56 42 19 Next, assuming that the heap represents a priority queue, show how the heap would look after the following series of operations. (2 points each) Note 1: Draw a diagram after each operation. The operations are to be cumulatively applied (i.e., each subsequent operation is to be applied to the heap resulting from the application of the preceding operation) Enqueue 44 Enqueue 70 . Dequeue .Dequeue