Match the following: 1) Quick Sort A) Divide and conquer programming 2) Task Scheduling B) Greedy programming 3) Merge Sort C) Dynamic programming 4) Prim's D) Not stable ) 1- 2- 3- 4-D b) 1-D 2-C 3- 4-B ) 1-D 2-C 3- 4- d) 1-C 2-D 3-A 4-B