2-B). Read the statement and write the appropriate choice in the box provided 13.0] Answer Problem Which sorting algorithm will take the least time (number of comparisons) when all elements of input array are identical? Consider typical implementations of sorting algorithms a. Insertion Sort h. Selection Sort Heap Sort d. Merge Sort Assume an array if integers = {2,4,3,1, 6); applying quick sort, which values would be selected as pivots a 2 and 1 b. 2 and 4 c3 and 6 d. 3 and 2 Which of the following sorting algorithms requires additional memory of size n. a. Merge sort b. Quick sort Insertion sort d. None of the above Which sorting algorithm gives O(n) comparisons and O(n) swaps for an array with random data? a Quick sort b. Insertion sort c. Merge sort d. Selection sort The run-time for searching a key in a complete Binary Search Tree is a. O(n) b. Oflog n) C 0(1) d. On Which of the following is an inappropriate search sequence for 36 in a BST posed of integers? a. 93, 27, 34, 62, 99,36 b. 11, 22, 33, 40, 35, 36 C. 23, 48, 42, 40, 33, 36 d. 11, 12, 13, 14, 25, 36