Part of designing a greedy algorithm is making the correct "greedy choice". Consider the Activity Selection problem. A correct greedy choice for this problem was to always add to the solution the compatible activity that ends earliest.

Which of the following greedy choices would also be correct for the activity selection problem? Select all that apply.

Comment: I$\text{'}$m looking for "common$-$sense" answers here, you can't necessarily find the answer by reading or watching it$,$ although I think it's pretty easy to reason out.

Question $1$ options:

Choose the compatible activity of the shortest duration.

Starting from the beginning of the day, choose the compatible activity with the earliest start time.

Choose the compatible activity that overlaps the fewest other activities.

Starting from the end of the day, choose the compatible activity with the latest start time.