Heap sort this input, [-1, 33, 36, 0, 13, 48, 31, 1, 13, 35, 10], into non-decreasing order. Assume root of the heap is at index 1 and exclude element at index 0 from sorting. a) Provide the result of heap construction b) Provide the result of each swap & sink