Draw the stack and queue data structures (for both the array and linked list implementations) for each step in the following sequence: add(1), add(2), remove, add(3), add(4), remove, remove, add(5)....

Draw the stack and queue data structures (for both the array and linked list implementations) for each step in the following sequence: add(1), add(2), remove, add(3), add(4), remove, remove, add(5). Assume an initial size of 3 for the array implementation.