Draw the completed tree for each array (Week 7 Lecture Slides). 34 31 27 18 12 11 8 5 3 2 98 67 77 46 30 12 10 8 6 4 Sort the following arrays using heapsort. Draw a separate tree diagram to illustrate each sort 4 31 7 18 10 9 8 11 17 6 78 33 27 29 12 38 10 17 8 55 67 23 19 20 12 34 29 15 20 Remove the last 6 elements from the tree draw in question 1 above, draw the updated tree (W 34 31 27 18 12 11 8 5 3 2 Draw the completed tree for each array (Week 7 Lecture Slides). 34 31 27 18 12 11 8 5 3 2 98 67 77 46 30 12 10 8 6 4 Sort the following arrays using heapsort. Draw a separate tree diagram to illustrate each sort 4 31 7 18 10 9 8 11 17 6 78 33 27 29 12 38 10 17 8 55 67 23 19 20 12 34 29 15 20 Remove the last 6 elements from the tree draw in question 1 above, draw the updated tree (W 34 31 27 18 12 11 8 5 3 2