A company needs to schedule a maximum number of meetings in a single conference room. Each meeting `i` has a start time `s_i` and an finish time `f_i`. Once a meeting starts, it must run to completion.     Consider the following greedy strategy:     1.  Sort all meetings by their start times in ascending order.     2.  Select the first meeting.     3.  From the remaining meetings, select the next meeting that starts after the previously selected meeting finishes.     4.  Repeat until no more meetings can be selected.     Given the meetings: `(s,
f)`   `M1: (1, 4)`     `M2: (3, 5)`     `M3: (0, 6)`     `M4: (5, 7)`     `M5: (8, 9)`     `M6: (5, 9)`     Which set of meetings will be selected by the described greedy strategy?