Using the linear time algorithm to build a min-heap from the binary tree stored in the following array. 5% 0 7 8 9 1 2 3 4 5 6 2 1 3 8 7 11 12 4 9 Then delete the minimum. 5% 10 5