Consider the following 3 machines and 5 jobs flow shop problem.

Job Processing Time Machine 1 Machine 2 Machine 3 1 7 4 3 2 9 5 8 3 5 1 7 4 6 2 5 5 10 3 4 Check whether Johnson's rule can be extended to this problem. If so, find the optimal schedule and the corresponding makespan.AppendixLO1