What is the asymptotic runtime bound of the following recurrence, using the master method? T(n) = 16T(n/4) + n! O a. O(n) b. O(n!) c. O(nlogn) d. The master method is not applicable O Which of the following search performances does a balanced binary tree have in the worst-case scenario? a. O(n) O b. O(log n) OC. 0(1) d. 0122 Which of the following sorting algorithms follows a greedy approach? O a. Insertion sort O b. Selection sort c. Merge sort O d. None of the above Which of the following sorting algorithms follows a divide and conquer approach? O a. Insertion sort O b. Selection sort c. Quicksort O d. Bubble sort