Problem 2. True or False. (15 points)

1. Both the Prim and Floyd algorithms can be used to solve for the shortest path between two points.

2. Both quick sort and merge sort are sorting algorithms based on partitioning techniques.

3. Greedy algorithms must satisfy feasibility, local optimality and non-cancellability.

4. Decrease and conquer can be performed either top-down or bottom-up.

5. Transform and Conquer method requires transforming the problem into a problem of the same type

Problem 3. (15 points)

Please briefly describe the divide and conquer algorithm(5 p), greedy algorithm(5 p) and their common and different properties(5 p), respectively.