5. A program consists of six tasks, which have execution times of 1000, 3000 6000, 5000, 2000, and 9000 cycles. It is not possible to divide the exectuoin of one task among multiple processors, but there are no communicaiton or syncronization costs. If the tasks aredistributed across the processors to achieve the shortes execution time, what is the speedup for executing program on a. One processor b. Two processors c. Three processors d. Four processors e. Eight processors f. Ten processors