Below are some alternative ways to approach the activity-selection problem using a greedy strategy. For each one, state whether it yields an optimal solution and give a counterexample if it doesn't. \begin{enumerate}[label=(\alph*)] \item Select the activity of least duration (from those that are compatible with already-selected activities)