Given the following data for jobs awaiting processing at a two$-$machine flow shop in which jobs are firstprocessed by machine A$,$ then by Machine B$.$ Suppose that we want to minimize the makespan. The processing sequence would be:

$\backslash$table$[[,$TIME $($hours$)],[$JOB$,$Center A$,$Center B$],[$W$,4,5],[x,6,6],[Y,1,2],[Z,5,2]]$

$$ W$-$X$-$Y$-$Z

Z$-$Y$-$X$-$W

X$-$W$-$Z$-$Y

Y$-$W$-$X$-$Z

None of the above