Given the following stack and queue of integers:

stack $=[$top$=51,-3,12,74,25],$ and queue $=[$front$=17,-21,33,$ rear$=6]$

Trace the stack and queue through the following operations:

queue.enqueue$(14)$;

queue.enqueue$($stack$.$pop$())$;

int i $=$ queue.dequeue$()$;

stack.push$($queue$.$dequeue$())$;

int j $=$ stack.peek$()$;

int k $=$ queue.first$()$;

stack.push$($k$)$;

queue.enqueue$($j$)$;

What are the values of i$,$ j$,$ and k$?$

Draw all the stack and queue elements after completing the above operations showing the top element of stack and the front and rear elements of queue. other method. Create a new array of twice the capacity and write a for loop to copy the content of the old array into the new one.