2-24 After splaying at node 1 in the given tree, which of the following statements about the resulting tree is TRUE? (2 point(s) ) oooooo O A node 5 is a child of node 2 O B. node 6 is a leaf node OC node 5 is a leaf node OD. the depth of the tree is 4 (where the depth of the root is 1) 2-25 Given input { 25 75 32 49.67. 12. 21. After the first partition (with the median-of-three as the pivot) of quick sort, the resulting sequence is_(2 point(s)) O A {21, 12, 25, 75, 67, 32, 49 } B. 25. 12. 32. 21, 49.75.67} OC 12.21, 25, 32, 49, 75, 67 } OD. 12. 21, 32, 49, 67, 25,75) 2-26 Given a sorted file of 100 records. To insert a new record by insertion sort with binary search the maximum number of comparisons is: (2 point(s) O A 50 O B. 25 C 10 OD. 7 2-27 If a stack is used to convert the infix expression atb*c+(d*c+f)*g into a postfix expression, what will be in the stack (listing from the bottom up) when f is read? (3 point(s) ) O A ++ OB. ++ OC +++ O D. abcde 2-28 Use binary search to find a number from 100 sorted numbers, the worst-case number of comparisons is: (2 point(s)) O A 50 OB. 10 . 7 OD. 99