Provide the structure of a dynamic array-based queue (you must list the queue contents, size, and capacity in the format provided below) after each iteration of the for loop when the following lines of code are executed. You should assume the initial capacity is 2. If size == capacity before inserting a new element, you will need to resize (by doubling the capacity and copying elements over to the new memory location). For the purposes of this question, the queue does NOT use a circular buffer implementation. values = Queue () for i in range (16): if i 3 : 0: values. enqueue ( i ) elif i 4 4=0: values. dequeue () Use the following format in the box below: i=,values=[],size=,capacity= (An example, not the right answer: i=0, values =[23], size =1, capacity =1 )