Q$18.2\mathrm{.}4)[4$ points$]$ Assume that you have a min$-$heap of $4$ nodes, containing entries with

keys: $6,12,14,$ and $18.$ Answer the following questions:

Q$18\mathrm{.}1.-$ List the structure of every possible min$-$heap that could match this description.

For each structure, list the keys in each level $($starting from level zero$)$ in order from the

left to the right. $[2$ point$]$

Q$18\mathrm{.}2.-$ For each of the structures you listed in the previous question, show what happens

with removeMin$()$ applied $4$ times $($describe the heap after each removeMin operation in

terms of the keys in each level $($starting from level zero$)$ in order from the left to the

right$).[2$ point$]$