Based on our lecture discussion, using a greedy algorithm to schedule 10 jobs of varying lengths (2, 4, 4, 8, 3, 3, 5, 3, 2, 1) across three (3) available processors, what would be the (maximum) finishing time of the schedule (so you need to find the minimum of the maximum finishing time among all the processors)?