can anyone provide answers with explaination ? thanks a lot

I. In the example of recycling the elements of a list in O1) time, which situation holds? A. Both lists are circular B. Both ists are not circular C. The list to be recycled is circular, the garbage list is not D. The garbage list is circular, the list to be recycled is not 2. What is the worst-case time to perform MINIMUML) for a sorted, doubly-linked list with nodes? A.6(1) B. Θ(log n) C. Θ(n) D. Θ(nlogn) . Which binary tree traversal corresponds to the following recursive code? void traverse (noderef x) if (x==null) retur / process x here traverse(x.left) traverse(x.right) A. norder B. postorder C. preorder D. search for key x 4. Suppose that only numbers in 100 appear as keys in a binary search tree. While searching for 50, which of the following sequences of keys could not be examined? A. 10, 30, 70, 60, 30 C. 1, 100, 20, T0, S0 B. 100, 20, 80, 30, 50 D. 10, 40, 70, 30, 50 5. What does counting sort count? A. the number of bytes in the input array B. the number of occurences for each possible key value C. the number of different input values that have oecured D. the maximum length among al the strings being sorted 6. Which of the following is not true regarding dynamic programming? A. It is a form of divide-and-conquer C. A cost function must be defined B. It is a form of exhaustive search D. The backtrace may be hased on recomputing the cost function . The time to extract the LCS for sequences of lengthsand ) atter filling in the dynamic programming matrix is in: C. Θ(n logn) D. emn) 8. The qucue for breadth-first rat-in-a-maze stores A. all maze positions that have walls B. maze positions that must be in the final path C. maze positions that have been reached D e current path being explored 9. For which of the following sorts does the decision tree model not apply? I0. Given a pointer to a node, the worst-case time to delete the node from a singly-linked list withn nodes in ascending order 11. Memoization is associated with which technique? A. Insertion B. LSD Radix Sort C. MERGE-SORT D. QUICKSORT C. Θ(n loge) A. top-down dynamic programming C. greedy methods B. circular lists D. bottom-up dynamic programming 12. If POP is implemented as return stackSPl, then PUSH of element X is implemented as A. return stack[SP++] B. stack[SP++]=X C. stack-SPJ-X D. stack[++SP]-X 13. The cost function for the optimal matrix multiplication problem is isk