5. Given this dataset for jobs that need two processes in sequence, please answer the following questions

Job	Processing Time A	Processing Time B
1	4	8
2	2	6
3	7	8
4	7	3
5	5	6
6	9	4
7	2	2
8	6	2

a) How many different schedulings does a problem of this size have?

b) How many schedulings of a problem of this size (at most) could minimize makespan?

c) Please compute a makespan-minimizing schedule for this problem.