1. (a) (1 point) Consider the Interval Scheduling problem discussed in the lecture. Given the following intervals as input, give the solution picked by Greedy Schedule algorithm discussed in class: 11 = (11, 13), 12 = (2,7), 13 = (6,8), 14 = (3,5), 15 = (4, 10), 16 = (9, 14), 17 (8, 12), 1g = (1, 2), 19 = (12, 16), 110 = (15, 17). (a) (b) (1 point) Consider the Job Scheduling problem discussed in class. Given the following (duration, deadline) pairs: Jy = (2, 10), J2 = (3,5), J3 = (4,8), JA (5,7), Js = (6,6) calculate the maximum lateness for each of the schedules below: (i) J1, J2, 13, J4, JS (ii) J2, J1, J5, J3, JA (iii) J5, J3, J1, J2, JA (iv) J5, J4, J5, J2, J1 1. (a) (1 point) Consider the Interval Scheduling problem discussed in the lecture. Given the following intervals as input, give the solution picked by Greedy Schedule algorithm discussed in class: 11 = (11, 13), 12 = (2,7), 13 = (6,8), 14 = (3,5), 15 = (4, 10), 16 = (9, 14), 17 (8, 12), 1g = (1, 2), 19 = (12, 16), 110 = (15, 17). (a) (b) (1 point) Consider the Job Scheduling problem discussed in class. Given the following (duration, deadline) pairs: Jy = (2, 10), J2 = (3,5), J3 = (4,8), JA (5,7), Js = (6,6) calculate the maximum lateness for each of the schedules below: (i) J1, J2, 13, J4, JS (ii) J2, J1, J5, J3, JA (iii) J5, J3, J1, J2, JA (iv) J5, J4, J5, J2, J1