Please answer the following problem in a spreadsheet. In Part B and part C, you just type in the objective and constraints in the spreadsheet and NO NEED TO SOLVE.

The board of directors of General Wheels Co. is considering seven large capital investment projects. Each investment can be made only once. These estimates differ in the estimated long-run profit (net present value) that they will generate as well as in the amount of capital required, as shown by the following table:

Investment Project	Estimated Profit (millions)	Capital Required (millions)
1	$17	$43
2	$10	$28
3	$14	$34
4	$20	$48
5	$7	$17
6	$13	$32
7	$9	$23

The total amount of capital available for these investments is $105 million. Investment project 1 and 3 are mutually exclusive, and project 5 cannot be taken unless project 3 is taken. The objective is to select the combination of capital investment projects that will maximize the total estimated long-run profit (net present value). Write down the algebra formulas and use Solver to solve the problems.

Part B. (2 points) If the objective is to invest as many projects as possible. How to write this objective function. Dont need to solve.

Part C. (8 points) write down the algebra constraints for the following requirements. Dont need to solve.

1. If project 1 is selected, then project 2 must be selected.

2. If project 1 is selected, then project 2 cannot be selected.

3. At least one of project 1, 2, and 3 is selected.

4. Either project 1 or project 2 can be selected, but not both.

5. At most one of project 1 or 2 is selected.

6. No more than two of the seven projects can be selected.

7. Project 1 cannot be selected unless project 2 is selected.

8. Project 1 can be selected only when project 2 is selected.