23 in a circular array queue implementation, to solve a problem of determine when the queue is full and when it is empty we use: swered at of 2.00 Select one: estion O a. reserve one location to be unused O b. recursive technique O c. iterative technique O d. this problem can't be resolved on 24 answered Suppose a stack is to be implemented with a linked list instead of an array. What would be the effect on the time complexity of the push and pop operations of the stack implemented using linked list (Assuming stack is implemented efficiently)? out of 2.00 question Select one: O A. O(1) for insertion and O(n) for deletion OB. O(1) for insertion and O(1) for deletion 1 queue is full and when it is empty we use Select one O a reserve one location to be unused Ob recursive technique O c iterative technique Od this problem can't be resolved Suppose a stack is to be implemented with a linked list instead of an array What would be the effect on the time complexity of the push and pop operations of the stack implemented using linked list (Assuming stack is implemented efficiently)? Select one: O AO(1) for insertion and O(n) for deletion O B.O(1) for insertion and O(1) for deletion O C. O(n) for insertion and O(1) for deletion O D.O(n) for insertion and O(n) for deletion o