(17 pts) Let's say we have implemented the following operations for a singly linked list and have placed them into a library: Insert at end // inserts the new data at the end of the list Insert in ascending order // inserts the new data in ascending order Insert in descending order // inserts the new data in descending order Delete at end // precond: list is not empty; deletes the data at the end of the list Delete nth item // precand: list is not empty; deletes the nth item in the list isEmpty // checks if the list is empty or not We cannot add anymore operations to our library. We can only reuse the ones that exist. We are developing a stack with only one pointer to the top of it. For the following events, provide the correct operations to apply from our library and draw a diagram with appropriate nodes and links. The stack is initially empty. Hint: you will need to write just one operation on each line provided below. Events: 1. Integer 5 is pushed to the stack. 2. Integer 9 is pushed to the stack. 3. The item at the top of the stack is popped. 4. Integer 2 is pushed to the stack. Event 1 Operation 1 (1 pt): Current diagram for the stack after Event 1 (show links!) (3 pts): Event 2 Operation 1 (1 pt): Current diagram for the stack after Event 2 (show links!) (3 pts): Event 3 Operation 1 (1 pt): Event 3 Operation 2 (1 pt): Current diagram for the stack after Event 3 (show links!) (3 pts): Event 4 Operation 1 (1 pt): Current diagram for the stack after Event 4 (show links!) (3 pts)