3. (15 points) Consider the same setting as the previous questionm but now we have 3 processors instead of 1. Each job has to be processed in a continious time interval on one of the processors, and the intervals on each one of the processors cannot overlap. Again we want to minimize the average finishing times. Is the greedy algorithm still optimal? In the greedy algorithm, every time a processor becomes available, among the unprocessed jobs we assign the one that has the smallest processing time to that processor. Either prove that this algorithm is optimal or give a counter-example showing that it does not always minimize the average of the finishing times. 3. (15 points) Consider the same setting as the previous questionm but now we have 3 processors instead of 1. Each job has to be processed in a continious time interval on one of the processors, and the intervals on each one of the processors cannot overlap. Again we want to minimize the average finishing times. Is the greedy algorithm still optimal? In the greedy algorithm, every time a processor becomes available, among the unprocessed jobs we assign the one that has the smallest processing time to that processor. Either prove that this algorithm is optimal or give a counter-example showing that it does not always minimize the average of the finishing times