algorithms analysis and design fasst please

One of the following is D&C technique O a. merge sort b. selection sort O c. insertion sort O d. bubble sort Clear my choice Connected graph has a path that cotains every node in the graph Select one: a. True b. False Let array A[] = {20, 22, 33, 36, 38, 49, 50, 61,63, 73, 74, 77, 85, 90, 97, 99} and the search key K =90. In the interpolation search we find the key after O a. 3 iterations O b. O iterations O c. 1 iteration O d. 2 iterations F