To delete the i^th node in a min heap, you can exchange the last node with the i^th node, then do the min-heapify on the last node, and then shrink the heap size to be one less the original size. is this deletion process results in a min-heap or not? Explain your answer.