Please just circle right answer no need for solutions

Q1: A stack is a container of objects that are inserted and removed in: a. In priority order b. First in first out order c. Random order d. Last in first out order. Q2: Recursive functions must have a: a. b. c. d. Print statement Exception handling routine Variable declaration. Base case Q3: AN array based stack has the following properties a. Fixed size b. c. d. All of the above Data that can be accessed in LIFO order. Push and Pop operation Q4: When implemented as a linked list, a Stack data structure: a. has a limited size b. becomes a random access data structure. c. is able to act as a queue as well as a stack. d. None of the above Q5: An application where a Stack data structures can be used is: a. Process jobs in a printer queue b. Performing matrix multiplications c. Sort and search objects d. Reversing the content of a vector Q6: In a Queue data structure, the function front does the following: Insert at the front of the queue Remove the front element Return and remove the front element Return, but do not remove, a reference to the front element in the queue a. b. c. d. Q7: Before removing an element in a Queue, one should call: a. The dequeue function b. Use the front) function to remove the element firts c. Should call enqueue first to make sure there is something in the queue d. The function empty to make sure that the queue is not empty