5 Multiple Choice Qs. Thank you (Algorithms and Analysis)

Consider the stack of [a, b, a, c, d, e], where the leftmost element is the top of the stack, i.e., 'a' and the rightmost element is the bottom of the stack, i.e., 'e'. After the following operations, pop, push f, pop was executed on this stack, what is the updated stack? [a,c,d,e,f] [f,a,c,d,e] [b,a,c,d,e] [f,a,b,a,c] [b,a,c,d,f] Which of the following is not a dictionary? The answers are specified as a collection of (key,value) pairs. [(a, 1), (b, 1), (c, 3), (d, 2), (e, 4)] [(2, d), (1, a), (3, a), (4, e), (7, f)] [(a,1),(e,1),(c,3),(d,2),(b,3)] [(a, 1), (c, 3), (e, 1), (a, 2), (b, 3)] [(2,d),(1,a),(3,c),(4,e),(7,f)] Consider the queue of [a, b, a, c, d, e], where the leftmost element is the front of the queue, i.e., 'a', and the rightmost element is the back of the queue, i.e., 'e'. After the following operations, dequeue, enqueue ' f ', dequeue was executed on this queue, what is the updated queue? [f,a,c,d,e] [b,a,c,d,f] [f,a,b,a,c] [b,a,c,d,e] [a,c,d,e,f] Consider the following undirected graph: The adjacency list representation of the above graph is partially filled in. A>,C,DB>AC>?>A What is the adjacency list of vertex C? If A, B, C, D are neighbours of C, then specify your answer as "A,B,C,D" in the answers. Note, the list should be in ascending order. A A,C B, D C A, B, D Consider the following directed graph: The adjacency list representation of the above graph is partially filled in. A?B>CC>A What is the adjacency list of vertex A? If A, B, C, D are in the list of A, then specify your answer as "A,B,C,D" in the answers. Note, the list should be in ascending order. A, C, D C, D B, C, D A, D C, B