A flow shop contains two machines which process the jobs in a fixed order. There are 7-jobs to be processed on the 2 -machines. The process times of the 7 -jobs are given below. Here p1&p2 indicates the process time of jit job on Machine-1 and Machine2 respectively. Work out the optimum sequence of processing the jobs in the order Machine-1 and then Machine-2 for the optimum value of Makespan using Johnson's Method. Arrange the following sets based on the above-mentioned process data and state the following particulars: (i) Form the Leading Set-1, Trailing Set-2 and the Tie-set; (ii) Combine the Tie-Set with the Leading Set-1 and sort the entries of p1/ as per the Shortest-Processing-Time (SPT) rule; (ii) Sort the Trailing Set-2 as per the entries of p2j according to the LargestProcessing-Time (L.PT) rule: (iv) Hence, form the Optimally Sequenoed set; (v) Work out the Directed Graph and state the value of the optimum Makespan, Cmaxi (vi) Work out the Gantt Chart indicating the idle-times. Hence indicate the total Idle-time of Machine-2