MCQ (NEED CORRECT ANSWERS ONLY) 20. Quick Sort can be implemented by a recursive function void heartfelementTyRE. A[ ], int Left, int Right ). If we are to implement the function gsorts) in a non-recursive way with a stack, which of the following should be packed as the elements of the stack? a) index of pivot b) value of pivot c) Left and right d) only Left or Right 21. Given input { 4321, 56, 57, 46, 28, 7, 331, 33, 234, 63 }. Which one of the following is the result after the 1st run of the Least Signification Digit (LSD) radix sort? a) +4321-331-33-63+234-56-46-57+728 b) +57-46-28+7+33234+63-56-4321-331 c) +331-4321-33-63+234-56-46-57+7+28 d) +56-28-4321-3313323446657637 22. Given a hash table of size 13 and the hash function h(x)=x mod 13. Assume that quadratic probing is used to solve collisions. After filling in the hash table one by one with input sequence {2, 15, 3, 29, 6, 25, 33, 7}, which number is placed in the position of index 7? a) none b) 7 c) 29 d) 33 vertices. 23. If graph G is NOT connected and has 21 edges, then it must have at least a) 8 b) 10 c) 9 d) 7 24. Use simple insertion sort to sort 10 numbers from non-decreasing to non-increasing, the possible numbers of comparisons and movements are: a) 100, 54 b) 54, 63 c) 45, 44 d) 100, 100