Question: Use python 3 for 1c Consider a different greedy algorithm: Among all TAs with start time 0, pick one with latest finish time. Then in
Use python 3 for 1c 
Consider a different greedy algorithm: Among all TAs with start time 0, pick one with latest finish time. Then in general, among all TAs with (start time) (finish time of the most recently picked TA), pick one with latest finish time. Keep going until the whole exam is covered. Use a "greedy stays ahead" argument to prove that this algorithm is optimal. The template is: Let
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
