1. Write a function void deleteMin (int A[], int N) in psuedocode, which takes as input, an array A representing a min-heap and the number of nodes N, and does the delete-min operation, i.e., deletes the minimum element and maintains the Heap property. Assume that A[0] is not used, and the keys are stored in A[1] .. A[N]. It must do the operations in-place, i.e., not making another copy of the array.