Consider the following sequence of integer keys: $12,42,54,16,27,21,53,5,84,18,65,77.$

$($a$)$ Illustrates the minimum heap that results after inserting the keys one by one in the given order.

$($b$)$ From the heap obtained, eliminate three minimal keys and display the resulting heap.

Draws the heap obtained for each insertion or deletion.