A company wish to produce the optimal ordering of 5 jobs on two machines where each job has to be processed on Machine 1 and then on Machine 2. The times of processing each job on each machine are as follows: Job ABCDE 8 13 966 Time on Machine 1 Time on Machine 2 10 11 7 3 8 Find the optimal ordering using Johnson's Algorithm and state the corresponding makespan. [8 marks]