1. A class of 11 students are to write a series of 3 tests online. For Test 1, the students can only write the test one at a time. For Test 2 and Test 3: there can be more than one students writing the test simultaneously. Each student is given a projected time (which varies from student to student) to write each test. The completion time of the series of tests is the earliest time at which all the students will be nished with writing the tests, assuming that each student spends exactly their projected time in each test. Given (oi, 5127(5); 1 <_1 n where :11 hi q- are the projected time of student for writing test and respectively. present a greedy algorithm that produces schedule students has earttest completion time. note such is needed because restriction must run in o>