Consider the same optimization problem for project choice. maximize 18 x1 + 21 x2 + 15 x3 subject to (constraints) x1 5 (Project 1 constraint) x2 3 (Project 2 constraint) x3 x2 (Project 3 constraint) x1 + x2 + x3 20 (Total time constraint) x1 , x2 , x3 0 Is x1 = 16, x2 = 3, x3 = 2 a feasible solution for this model? No, total time would be 21 hours, so total time constraint not satisfied Which of the following options is the best answer to the question on slide #15 of lecture #8? Yes, feasible solution. No, violates Project 1 constraint. No, violates Project 2 constraint. No, violates Project 3 constraint. No, violates total time constraint