the optimal solution results in total workers =

Decision vairable: X1= number of woskers reporting for the start of working period i, where i=1,2,3,4,5, or 6 . Owner Avanti Sethis scheduling problem is to determine how many servers should report for work at the start of each time period in order to minimize the total staff required for one day operation. (Hint Let X, equal the number of servers beginning work in time period 1 , where I=1,2,3,4,5,6 ) Objective function: Minimize Z=x1+x2+x3+x4+x5+x6 Subject to: x1+x2=15x2+x318x3+x412x4+x514x5+x63x6+x13Forallx10 (7AM,-11AM.)(11AM.-3PM.) (3 PM - 7PM.) (7 PM, - 11 P.M.) (11 PM. - 3AM.) (3 A.M, - 7 A.M.) The optimai solutioci results in total workers a (enter your response as a whole number)