please explain with steps the true options.

Start with an empty heap, insert 10,12,6,14,1,5 in order into a max-heap. Which numbers require swapping (percolating up) when we insert them? Select all that apply. 0 10 12 6 14 0 1 5 b) Start with an empty heap, insert 9,15,6,21,-5,1 in order into a min-heap. Which numbers ever been stored at the top (root)? Select all that apply. 9 O 15 6 O 21 -5 O 1