please show steps

You need to modify the spreadsheet provided to include the VXP computers. Then you need to find the new optimal solution. I will look at the optimal number of computers to produce and at the value of the objective function. (12 points). Round the values of the optimal number of computers from part a. Is the solution still feasible? Basically check if the number of hours used is still less than the number of hours available ( 6 points). If the rounded solution was not feasible, look for integer values closed to the ones obtained on part a (by trial and error), until you find an optimal combination that maximizes the value of the objective function AND is feasible. ( 6 points). You need to modify the spreadsheet provided to include the VXP computers. Then you need to find the new optimal solution. I will look at the optimal number of computers to produce and at the value of the objective function. (12 points). Round the values of the optimal number of computers from part a. Is the solution still feasible? Basically check if the number of hours used is still less than the number of hours available ( 6 points). If the rounded solution was not feasible, look for integer values closed to the ones obtained on part a (by trial and error), until you find an optimal combination that maximizes the value of the objective function AND is feasible. ( 6 points)