The ith ta holds office hours starting at time si and ending at time ei. each ta holds exactly one office hour (which may last any amount of time, not necessarily one hour, and different tas may have different interval lengths, which may overlap with one another). attendance has been low because students, being ics majors, are afraid of the sun, so the department announces that all tas who do not have a student visit them this week will be fired1. because all of our teaching assistants are awesome2, we want to ensure that none get fired. however, due to student fears of the sun, we want to minimize the total number of visits made to tas. for purposes of this problem, assume each ta’s office hour time is one continuous interval with no breaks, and that a student visiting the sundeck at time t counts as visiting all tas whose office hours interval contains t. also assume that student visits are "instantaneous," in the sense that the amount of time a student stays in the sun is negligible – formally, each student visits the deck at a single point in time. this also to avoid exposing a student to the sun unnecessarily. you propose the following: first, we sort all of the intervals by end time. we send a student to attend office hours at the moment immediately prior to the end of the first ending interval. we remove from our input all tas who overlap with this time, and if the remaining set is non-empty, we repeat. prove that the greedy algorithm in the previous statement minimizes the number of stu- dents we need to send to visit tas.