5. An integer programming (maximization) problem was first solved as a linear programming problem, and the objective function value (profit) was $253.67. The two decision variables (x, Y) in the problem had values of X = 12.45 and Y = 32.75. If there is a single optimal solution, which of the following must be true for the optimal integer solution to this problem? A) X=12 Y = 32 B)X = 12 Y=33 C) The objective function value must be less than $253.67. D) The objective function value will be greater than $253.67. E) None of the above answers is correct. Exhibit 2. Consider the following network. The activity durations (in days) are shown in the nodes, the variance of all activities is 1 day except for activities D, F, and G; their variance is 2 days. 6. Refer to Exhibit 2. Which path is the critical path? A) ABDFH B) ACEFH C) ACEGH D) ACGH E) None of the above answers is correct. 7. Refer to Exhibit 2. How long will it take to complete the project? A) 24 days B) 25 days C) 26 days D) 27 days E) None of the above answers is correct. 8. Refer to Exhibit 2. The project manager is negotiating a contract that will provide a substantial bonus if they can complete the project within an agreed deadline. What deadline would give them a 75% chance of finishing the project? A) 26.78 days B) 27.86 days C) 28.67 days D) 29.87 days E Nane of the above answers is correct