For the following data, using Johnson's algorithm to calculate:
a) The best schedule of six tasks to get the minimum makespan.
b) The minimum makespan.
c) Waiting time on each processor.
Task 1 2 3 4 5 6
Time on processor 1, t Time on processor 2, ti
2 2 10 9 11 12
3 1 6 8 4 5