6) (5 bonus points) Choose the best answer from A) divide-and conquer B) dynamic programming C) greedy approach D) brute force approach

I. (1pts) Which algorithm design paradigm is exemplified by the Dijkstras singlesource shortest path algorithm?

II. (1pts) Which algorithm design paradigm is exemplified by the 0-1 knapsack algorithm we discussed in class?

III. (1pts) Which algorithm design paradigm is exemplified by the binary search algorithm?

IV. (1pts) Which algorithm design paradigm is exemplified by the fractional knapsack algorithm?

V. (1pts) Which algorithm design paradigm is exemplified by the Prims MST algorithm