Q2. [10 marks] Answer the following questions about Queues. (i). [5 marks] Assume that we have an empty queue . Given a series of queue operations on as below, write down the element returned by each Deqeue operation and show the final queue. Enqeue(, 3), Enqeue(, 6), Deqeue(), Deqeue(), Enqeue(, 8), Enqeue(, 5), Deqeue(), Enqeue(, 7), Deqeue(). (ii). [5 marks] Suppose that an array of size 8 is used to store a circular queue, and the values of the front and rear are 0 and 5, respectively. Now after 1 dequeue and 3 enqueues, what will the values of the front and rear be?