(Part 1) Using the keys 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 and 12, draw a legal binary min heap that stores these keys such that after deleting 8 from the heap, the resulting repair of the binary heap involves the replacement node bubbling up (towards the root).
(Part 2) Using the keys 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 and 12, draw a legal binary min heap that stores these keys such that after deleting 8 from the heap, the resulting repair of the binary heap involves the replacement node trickling down (towards the leaves).