Data Structure and Algorithm

11 [10 points] Give the output of the execution of the following code segment, assu initially empty. Show the queue contents at each after each enqueue/dequeue operation. ming the queue Q was for i 1 to 10 do Q.enqueue (i*2) if (i % 2- 0) 2.dequeue; if (i % 3 == 0) cout