(a) The following questions are based on a "Queue data structure as shown in Figure Q2(a). [0] N 2 [1] 8 [2] 4 rear [3] 44 [4] 81 front [5] 24 [6] 0 Figure Q2(a) (1) How many data currently in the "Queue"? [2 marks] (ii) List the data elements in order from front to rear. [2 marks] (iii) When all data in the Queue are removed, draw the final result in the Queue. [2 marks]