Algorithm

1. Answer "True" or "False" for the following statements. You don't have to explain answer.

2.1 Given a set of activities and the starting & finishing time of each activity

2.2 Find out the maximum number of activities that can be performed by a single person assuming that a person can only work on a single activity at a time

2.3 Also, give a set of activities that match the optimal solution

1. Answer "True" or "False for the following statements. You don't have to explain your answer. (a) (10pt) We can use dynamic programing to solve the activities selection problem (b) (10pt) Dynamic programming is an algorithm instead of a technique. (c) (10pt) We can use dynamic programing to solve Longest simple path problem. (d) (10pt) The idea of greedy algorithm is making the locally optimal choice at each stage with the intent of finding a global optimum. 2. 2.1 Given a set of activities and the starting & finishing time of each activity, 2.2 Find out the maximum number of activities that can be performed by a single person assuming that a person can only work on a single activity at a time. 2.3 Also, give a set of activities that match the optimal solution. i 1 2 3 4 5 6 0 3 1 5 10 8 Si fi 6 4 2 9 7 9