Question

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

Answer 1

Answer:

I didn't understand what's ur asking