Table 8-6 The following is a linear programming formulation of a labor planning problem. There are four overlapping shifts, and management must decide how many employees to schedule to start work on each shift. The objective is to minimize the total number of employees required while the constraints stipulate how many employees are required at each time of day. The variables X1 - X4 represent the number of employees starting work on each shift (shift 1 through shift 4). Minimize Subject to: X1 + X2 + X3 + X4 X1 + X4 2 12 (shift 1) X1 + X2 2 15 (shift 2) X 2 + X3 2 16 (shift 3) X3+X 4 2 14 (shift 4) all variables > 0 Final Optimal Solution: Z = 29.000 Variable X1 X2 X3 X4 Value 13.000 2.000 14.000 0.000 According to Table 8-6, which describes a labor planning problem and its solution, how many workers would be assigned to shift 4? 14 0 16 1