1. How do the markers queueHead and queueTail relate with each other in case of an empty queue implemented using circular array 2. How do the markers queueHead and queueTail relate with each other in a queue having only one element where the queue is implemented using circular array. 3. How do we update the queueHead marker in case of circular array based queue implementation? 4. How do we update the queueTail marker in case of circular array based queue implementation? 5. How do we initialize the queueHead and queueTail in case of circular array for queue 6. Define the parameterized constructor of queueADT as described in Figure 1. 7. Define the getFront function in queueADT class design as described in Figure - 1 8. Define the getEnd function in queueADT class design as described in Figure 1 9. Complete the definition of insertQueue function as described in the Figure -1 10.Complete the definition of removeQueue function as described in the Figure 1