5. Build a max heap by inserting the following elements one by one into an empty heap: 10, 14, 33, 27, 35, 19, 42. Show the state of the heap after each insertion step. (10%)
6. An array with 8 elements is being sorted using quicksort. After the first partition step (including pivot placement), the array becomes [4, 6, 9, 3, 10, 15, 12, 22]. List all possible values that could have been chosen as the pivot in this first partition step. (10%)