Assume a computer with three parallel processors CPU1, CPU2 and CPU3. A sequence of jobs J is submitted to this computer where J[i] is the time it takes to execute job i in miliseconds (suppose the performance of each processor is equal). Given a sequence of jobs J ={10, 3, 11, 18, 6, 14, 5, 20, 15} what will be the earliest finish time of all jobs in J when:

A. Jobs are distributed to whichever processor is available in arrival order. B. Jobs are distributed to whichever processor is available by selecting the shortest job first each time.

C. Jobs are distributed to whichever processor is available by selecting the longest job first each time.

D. Compare finish times you computed in A through C. Can you propose a better algorithm? How? Please explain and compute the earliest finish time of your proposed solution.

Note: While assigning jobs, always consider the processors in the order first CPU1, then CPU2 and then CPU3.