Note: All functions must be given in Pseudocode

3 [20 Points] Write a function int maxAtLevelK (Node *v), which takes as input, the pointer to the root of a Binary Tree, and an integer argument K, and returns the maximum of key values of nodes at level K (Note: root is level 0) In the example below, if called with K = 1, must return 9; if called with K = 2, must return 12. 7 10 4 [20 Points] Write a function void deleteMin (int A[], int n) 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[O] 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