Press CTRL ALT DELE 3. Su maximum size 20.Suppose the value of queueFront is 1 ad queueRear is 6 ppose that a QueueClass (circular queue array implementation) object is of a) What is the queue size count (number of elements actually in the queue)? b) If five elements at the front are removed from this queue, what is the value of queueFront and the value of queueRear? c) Two String objects Good" and "Bad" are added in sequence. Which slots of the array (partially shown below) will each of them be at, respectively? d) What are the values of queueFront and the value of queueRear after adding these two in the queue in part c)? 4. Suppose q is a queue as shown below. Show the final queue after the execution of the (pseudo) code. front 11 6 9 12 15 6 8 74 while (q.poll>0 q.offer (.poll) poll O) 5. The array form of a min-heap is 1 6 14 22 29 16 39 50 27 33 35 28. Draw the tree form of the heap. (DO not change the array in this problem!)