Use Johnson's rule to determine the optimal sequencing for the five jobs to be processed on two machines in a fixed order $($Machine $1$ before Machine $2).$ The processing times in hours are given in the table below.a$.$ What is the optimal sequence?b$.$ What is the total flow time for this sequence?c$.$ Which job is the first to be scheduled? Is it scheduled to be the first job or the last? Explain.JobAB$($DEFMachine $110814$Machine $211171013108259615$