Suppose execute the following stack operations on we a stack of ints. push(1); push(4); push(3); pop() push(5); push(18) pop(); push(7); pop(); pop(); Draw the final state of the stack, and for each pop() operation, write next to it the value that will be popped off the stack. Suppose we have an array-based queue What will the final state of the array look like? (circular buffer) of size 6: int data[6]: 1 12131 4 15 int front8, back e; void enqueue(int x) data[back] x; backs (back + 1) % 6; void dequeue) f , front : (front + 1) 1.6; and we perform the following series of queue operations: enqueue(1); enqueue(4); enqueue(2); enqueue(7); dequeue); dequeue); enqueue(5); dequeue() enqueue(6); dequeue) enqueue(3)