no need explanation just answer the following question.

Question 19 2.5 pts The worst-case time complexity of Merge sort algorithm is A. Oin) O B. Oln^2) OC. O(nign) Question 20 2.5 pts What is recurrence relation for worst-case scenario of Quick Sort and what is its time complexity in the worst case? A. Recurrence is Tin) - Tin-2) +O) and time complexity is om 21 B. Recurrence Is Tin) - Tin-1). On) and time complexity is on 2) C Recurrence is T) - 26/2) + Oin) and time complexity is O(nlen) Question 17 2.5 pts The difference between Divide and Conquer and Dynamic Programming is: O A. Whether the subproblems overlap or not OB. The division of problems and combination of subproblems O C. The way we solve the base case Question 18 2.5 pts Dynamic programming is similar to divide and conquer in that we find a(n) property A overlapping B. recursive OC backtracking D Question 15 2.5 pts Which of the following algorithm is NOT a dive and conquer algorithm by nature? O A. Merge Sort O B. Quick Sort OC. Strassen's Algorithm to Matrix Multiplication OD. Floyd's Algorithm for All-Pairs Shortest Paths Question 16 2.5 pts A divide and conquer approach to solving a problem is useful when O A. We can break the problem into several subproblems that are similar to the original problems but smaller in size OB. The subproblems are overlapping so we don't have to solve them over and over again C. The complexity has exponential to solve the entire problem An 17