This question is designed to help you get a better understanding of basic heap operations. Change Theme There are 3 types of query: - " 1v - Add an element v to the heap. - " 2v - Delete the element v from the heap. - " 3 " - Print the minimum of all the elements in the heap. NOTE: It is guaranteed that the element to be deleted will be there in the heap. Also, at any instant, only distinct elements will be in the heap. Input Format The first line contains the number of queries, Q. Each of the next Q lines contains one of the 3 types of query. Constraints 1Q105109v109 Output Format For each query of type 3 , print the minimum value on a single line. Sample Input STDIN Function Q=5 insert 4 insert 9 print minimum delete 4 print minimum Sample Output 4 Upload Codeas File Test against custom input