Question 1 Given the following sequence of operations add(4); add(8); add(1): remove(); remove(): add(6); add(3) show with diagrams below the final state of the data structure when it is: a. a stack using a linked representation (so add/remove correspond to push/pop); b. a stack using a blocked representation of size 4; c. a queue using a linked representation (so add/remove correspond to enqueue/dequeue) d. a queue using a cyclic blocked representation of size 4. Stack linked Stack blocked Queue linked Queue cyclic blocked