with explaination

thank you

Why is it common for a circular queue implementation to waste one table element? A. To avoid confusing an empty table with a full table B. To have a place to store the tail and head values C. To make sure the queue always has at least one element in use D. To perform some loops faster When evaluating a prefix expression, the stack contains A. Both operands and operators B. Both parentheses and operators C. Operands only D. Operators only The worst-case time to find the maximum key in a circular, doubly-linked list with r ascending order is: 5. 6. 7. nod