Suppose a circular buffer dynamic array of capacity 4 is used to implement a queue. Show the contents of the array after the following sequence of operations: enqueue(D), enqueue(E), enqueue(F), dequeue().

Assume the circular buffer state before these operations is [- , B, C, - ] where B is the start. Note the array indices are [0, 1, 2, 3] and that after enqueuing each new element, the algorithm checks the size. When size == capacity, the capacity is doubled, and all the elements are copied to the new memory location.

Format like this:

values = [ ] start= , size = , capacity =

Suppose a circular buffer dynamic array of capacity 4 is used to implement a queue. Show the contents of the array after the following sequence of operations: enqueue(D), enqueue(E), enqueue(F), dequeuel). Assume the circular buffer state before these operations is [-, B, C, - ] where B is the start. Note the array indices are [0, 1, 2, 3] and that after enqueuing each new element, the algorithm checks the size. When size == capacity, the capacity is doubled, and all the elements are copied to the new memory location