Suppose a sorted increasing array indexed $\backslash (\backslash$mathrm$\{$H$\}[\backslash$underline$\{\backslash$underline$\{1..$ n$\}\}]\backslash )$ is to be turned into a Min Heap.

$($a$)$ Estimate the number of swaps in the Heapify algorithm.

$($b$)$ Suggest the best way to process the same sorted increasing array to turn it into a Max Heap to maximize the performance $($optimize the Heapify speed, minimize swaps$).$

$($c$)$ Describe the location $($row of the tree and position within the row$)$ of the Heap node indexed by $\backslash (\backslash$mathrm$\{$H$\}\backslash$left$[2^\{\backslash$mathrm$\{$m$\}+1]\}\backslash$right$.\backslash ),$ where $\backslash ($ m