2. Show the results of the following sequence of events, by drawing the state of the data structure: add (4), add (8), add (1), add (6), remove(), remove ) where add and remove are the operations that correspond to the basic operations in a 1) Stack 2) Queue and 3) Linked List Ans: Draw the diagrams in each case. 3. Suppose you have an array A with actual elements indexed from 1 to N. Write an algorithm to insert an element called ITEM at i-th location into the array. You may assume there are some unused spaces in the array. Note: Look at slides 4. Suppose you have an array A with actual elements indexed from 1 to N. Write an algorithm to delete an element from the ith location of the array. Note: Look at slides 5. Suppose you have an array A with actual elements indexed from 1 to N. Suppose you want to delete the 2nd element. Write an expression for total number of shift operations required