Re-write the answer to this question in your own words, different example.

Problem Not just any greedy approach to the activity-selection problem produces a maximum-size set of mutually compatible activities. Give an example to show that the approach of selecting the activity of least duration from those that are compatible with previously selected activities does not work. Do the same for the approaches of always selecting the compatible activity that overlaps the fewest other remaining activities and always selecting the compatible remaining activity with the earliest start time Step-by-step solution Step 1 of 3 A 1. For the approach of selecting the activity of least duration from those that are compatible with previously selected activities duration This approach selects justa, but the optimal solution selects (aiaj) Comment Step 2 of 3 2. For the approach of always selecting the compatible activity that overlaps the fewest other remaining activities 1 2 3 4 5 6 7 8 9 10 11 2 3 3 3 4 5 6 7 7 7 8 #of over lapping activities 3 4 4 4 4 2 4 4 4 4 3 This approach first selects ag and after that choice it can select only two other activities (*ne of a1,a,,a, and one of as ,a9Ay,an). An optimal solution is a1.af.a.31