Submission: Please submit the solution to this exercise in Learn by the due date. Recall the SLLNode class discussed in the week 1 lectures, Consider us- ing this to implement a SLLStack and SLLQueue data structures, where SLLStack represents a stack and SLLQueue represents a queue. Both were discussed briefly in lectures and you can look at more information at https://en.vikipedia.org/viki/Stack (abstract data type) and https: //en.vikipedia. org/wiki/Queue (abstract data type) A basic set up for each is as follows: class SLLStack SLLNode top- nul1; / Records the top element of the stack SLLStack O // Default constructor void sPush (Object x)f ...I/ Creates a SLLNode containing // x and adds it to the top of the staclk Object sPop) ...// Removes the top node (if it exists) of the stack // and returns the value (of the removed node) class SLLQueue SLLNode tail- null; // Records the last element (tail) of the queue SLLQueue O // Default constructor void qPush (Object x) ( // Creates a SLLNode containing // x and joins it to the tail of the queue Object qPop) ...) // Removes the head node (if it exists) of the // queue and returns the value (of the removed node) (a) Draw(successive) diagrams of a stack after each call of sPop, Indicate where the pointer top is after each method call. sPush 10 SLLStack myStack-SLLStackO myStack.sPush(1) myStack.sPush (2) myStack.sPush(3); int x- ayStack.sPop Draw (successive) diagrams of a stack after each call of qPop, Indicate where the pointer tail is after each method call (b) qPush SLLStack myQueue-SLLQueue myQueue.qPush (1); myQueue.qPush (2) myQueue.qPush (3) int x- nyQueue.qPop (c) Consider implementing the q Pop method using the given specification of the SLLQueue class given. Write down a problem with the given specification that could cause performance issues in large queues Suggest a simple improvement to the given design which would mit igate the problem you have identified Note: You do not need to provide an implementation. Submission: Please submit the solution to this exercise in Learn by the due date. Recall the SLLNode class discussed in the week 1 lectures, Consider us- ing this to implement a SLLStack and SLLQueue data structures, where SLLStack represents a stack and SLLQueue represents a queue. Both were discussed briefly in lectures and you can look at more information at https://en.vikipedia.org/viki/Stack (abstract data type) and https: //en.vikipedia. org/wiki/Queue (abstract data type) A basic set up for each is as follows: class SLLStack SLLNode top- nul1; / Records the top element of the stack SLLStack O // Default constructor void sPush (Object x)f ...I/ Creates a SLLNode containing // x and adds it to the top of the staclk Object sPop) ...// Removes the top node (if it exists) of the stack // and returns the value (of the removed node) class SLLQueue SLLNode tail- null; // Records the last element (tail) of the queue SLLQueue O // Default constructor void qPush (Object x) ( // Creates a SLLNode containing // x and joins it to the tail of the queue Object qPop) ...) // Removes the head node (if it exists) of the // queue and returns the value (of the removed node) (a) Draw(successive) diagrams of a stack after each call of sPop, Indicate where the pointer top is after each method call. sPush 10 SLLStack myStack-SLLStackO myStack.sPush(1) myStack.sPush (2) myStack.sPush(3); int x- ayStack.sPop Draw (successive) diagrams of a stack after each call of qPop, Indicate where the pointer tail is after each method call (b) qPush SLLStack myQueue-SLLQueue myQueue.qPush (1); myQueue.qPush (2) myQueue.qPush (3) int x- nyQueue.qPop (c) Consider implementing the q Pop method using the given specification of the SLLQueue class given. Write down a problem with the given specification that could cause performance issues in large queues Suggest a simple improvement to the given design which would mit igate the problem you have identified Note: You do not need to provide an implementation