Assume that we have the queue implemented as a circular array-based version tn get the optimal hig-n. Assume we start with the given dynamic array with capacity 4 and 2 values; assume the dynamic array doubles capacity for expansion but never shrinks. Draw the underlying array after the given operations in sequence are performed. Mark clearly where is front/back of the queue. Operation // starting status enqueue ( Q ) enqueue (R) // continuing dequeue() // continuing enqueue (S) enqueue(T)