A set of jobs $\text{U, V, W, X, Y, Z}$ arrive at time $t=0$ to a production line consisting of two workstations in series. Each job must be processed by both workstations in sequence (i.e., the first followed by the second). The process times (in minutes) for each job on each workstation in the production line are given below.
\begin{array}{|l|l|l|l|l|l|l|}
\hline \text{Job} & U & V & W & X & Y & Z \\
\hline \text{Workstation }1 & 5 & 7 & 3 & 4 & 6 & 8 \\
\hline \text{Workstation } 2 & 4 & 6 & 6 & 8 & 5 & 7 \\
\hline
\end{array}
The sequence in which the jobs must be processed by the production line if the total makespan of production is to be minimized is
- $\text{W-X-Z-V-Y-U}$
- $\text{W-X-V-Z-Y-U}$
- $\text{W-U-Z-V-Y-X}$
- $\text{U-Y-V-Z-X-W}$