answer with explaination please . thank you

5. Why is it common for a circular queue implementation to waste one table element? A. B. C. D. When evaluating a postfix expression, the stack contains A. B. To avoid confusing an empty table with a full table To have a place to store the tail and head values To make sure the queue always has at least one element in use To perform some loops faster 6. Both operands and operators Both parentheses and operators C. Operands only 7. The worst-case time to find the maximann key in a circular, doubly linked list with n nodes in a sceldung order is: B. elog n) C. em log n) D. e(n) 8. How should the successor of a leaf in an uabalanced binary search tree be found? A Examine the ancestors of the leaf B. Go ight, then preseed to the lef O Type here to seatch