Q3.1 (1.5 marks)Consider the following heap. Show the steps needed to delete the node (4,C) 4,C 5,A 6,Z 15,K 9,F 7,Q 20,B (16,X) 25,J (14,E 12,H (11,S) Q3.2 (1.5 marks) Show the execution of the following map operations Operation Output Map isEmpty() put(5,4) put(2,C) put(2,E) get(5) get(4) size() remove(5) remove(2) isEmpty() Q4 Draw the 11-entry hash table that results from using the hash function, h (i) i mod 11, to hash the keys: 12, 44, 13, 88, 23, 94, 11, 39, 20, 16, and 5, Q4.1 (1.5 marks) Assuming collisions are handled by chaining