Answer:
Option C and Option D.
Explanation:
When the title indicates, a greedy algorithm often makes the decision which imply to be the best overall. Which obviously makes a locally-optimal choice throughout the expectation that such a option can contribute to an answer that is generally optimal.
so, Earliest finish time and latest start time are the greedy methods resulting in an effective solution for the problems of operation selection.
