8. (10 pts) Stacks and Queues: What does a queue implemented with a dynamically resized array that starts with size 4 look like after the following operations: enqueue (0), enqeue (1), enqueue (2), dequeue enqueue (3), dequeue),enqueue(4), enqueue (5),enqueue (6), dequeue 9. (5 pts) Stacks and Queues: Assume a stack implemented with a linked list has the following code for pop () void pop) Node n-top->next->next; top->next->next- top->next->next->next delete ni What would the push ) method look like? (Nevermind that no one would actually write this code for pop).) 10. (5 pts) Stacks and Queues: Assume you have a class Stack that provides T top ().void pop), void push (T data), and bool isEmpty). It provide NO OTHER METHODS. Write a function bool contains (T data) that determines if a value is in the stack. Upon return the stack should be unaltered