Problem 7: Queues (10 points) Consider the queue data structure. it has the following operations initQueuel mpyto), enqueuetQ. item), dequeue(Q). and freeQueue(Q) as defined in lab (see code appendix if you need to see the code). The queue data type is int the queue is implemented with an array of size 8 (so 7 elements canis queue at any given time). Assume an element cannot be enqueued if the queue is full. Assume the main function is written as follows: int nain (woid] enquese (q. 5) dequeue(g)i enqueue t4. 11 dequeue (qla enqueue (q 141 Ai What is q's contents? enqueue (q3) eaqueue (g.121 dequeue (q)i enqueue (q. 13) enqueue Iq, 71)a dequeve (q) enqueue ( 221 // B: what is q, contents? back of queue A: (3 points) front of que B: (3 points) front of queue1 C. In the code above, what is q->data, q->head, and q->tail at each point (A BO back of qucuc points)dta head: tail:I data: B (4points) head ait 12