The following Table shows the required start and finish times of 10 jobs. Find maximum subset of mutually compatible jobs in 8 hours (Start time = 0, end time = 8) by using a greedy algorithm. Show the sequence of these jobs. (You need to show your work for receiving credit) (20 pts.) 1 3 4 6 9 10 WN 5 0 7 5 w00 7 2 1 2 1 4 Job # Start time Finish time 8 7 5 4 4 8 6 2 7