Question 1. (3 x 4=12 Marks] A. Write a C++ code (function) to search an element in a queue? Also assume the situation that, you are adding required function in a code that already solved the issue of array implementation of queue when there is space but you cannot enter more elements? B. Recall your implementation of a binary search tree. Write a function int levelOf(int k) that computes and returns the level of the node with the key k. (Consider the root at level 1) C. Write a C++ function int deleteMax() that deletes the maximum value from the max heap (obviously the value in the root). Ans. Q.No.1