Consider inserting $10,12,1,14,6,5,8,15,3,9,7,4,11,13,2,$ one at a time, into an initially empty binary heap. $(20$ pts $)$

a$)$ Draw the final heap. $(10$ pts $)$

b$)$ Draw the heap after exactly three deleteMin operations are performed. $(10$ pts$)$