You are given a list of numbers for which you need to construct a min$-$heap.

$($A min$-$heap is a complete binary tree in which every key is less than or equal

to the keys in its children.$)$ How would you use the problem reduction technique to design an algorithm for constructing a max$-$heap $($a heap as defined in Section $6\mathrm{.}4)$ to construct a min$-$heap?