max heap insertion (tree) 1.) 3, 4, 8, 3, 8, 9, 6, 4, 5, 5 2.) 1, 2, 3, 4, 5, 6, 7, 8, 9

delete one node from this max heap. Redraw the new heap as an array. 1.) 9, 8, 7, 6, 5, 4, 3, 2, 1 2.) 9, 6, 7, 6, 5, 4, 3, 2, 1, 4, 4, 3, 3, 2, 2 3.) 9, 9, 8, 9, 8, 8, 7, 2, 1, 8, 6, 6