Match the following and select the correct option. Prims's algorithm Dynamic programming 1 a Binary search algorithm 2 b Divide and conquer programming Quick sort algorithm Greedy programming Traveling salesmen algorithm 4 d. Decrease-and- Conquer programming a) 1-,2-,3-d,4-b b) 1-c,2-a,3-b,4-d c) 1-d,2-c,3-a,4-b d) 1-c,2-d,3-b,4-a 3.