Given n events with their starting and ending times, which of the following greedy strategies leads to a correct algorithm for scheduling the largest number of non-conflicting events?

Assume that in all strategies, you will not select an event that conflicts with one you have already scheduled.

A) Always choose the event with the earliest start time first.

B) Always choose the event with the earliest end time first.

C) Always choose the event with the shortest time first.

D) Always choose the event that conflicts with the fewest other unscheduled events first.