16.1-3 Not just any greedy approach to the activity-selection problem produces a max- imum-size set of mutually compatible activities. Give an example to show that the approach of selecting the activity of least duration from among those that are compatible with previously selected activities does not work. Do the same for 16.2-x Solve (using Dynamic Programming) the following 0-1 Knapsack problem 1 2 3 4 6 5 3 7 W-10 2 1 5 V 6 4 9 w 4 3 1 6 4