Five projects are available for investment. The projects require the cash flows and yield the net present values (in millions) shown in the following table. If $22 million is available 2. for investment at this time, we want to determine the investment plan that maximizes the total net present value. Project 1 2 3 4 5 Net Present Value $24.0 $19.2 $5.6 $12.4 $4 Required Cash Flow $16 $12 $6 $8 $4 Formulate an integer program that will determine such investment plan. Solve the problem using branch and bound by hand. You can solve the linear programming relaxation of the IP problem at each node of the branch and bound tree using the software of your choice (EXCEL, Matlab, or Xpress). You must clearly show the branch and bound tree, and at each node of the tree, you must clearly indicate the solution to the LP relaxation and the appropriate bounds. You must also clearly indicate the fathomed nodes and the reason for their fathoming and the final optimal solution. Five projects are available for investment. The projects require the cash flows and yield the net present values (in millions) shown in the following table. If $22 million is available 2. for investment at this time, we want to determine the investment plan that maximizes the total net present value. Project 1 2 3 4 5 Net Present Value $24.0 $19.2 $5.6 $12.4 $4 Required Cash Flow $16 $12 $6 $8 $4 Formulate an integer program that will determine such investment plan. Solve the problem using branch and bound by hand. You can solve the linear programming relaxation of the IP problem at each node of the branch and bound tree using the software of your choice (EXCEL, Matlab, or Xpress). You must clearly show the branch and bound tree, and at each node of the tree, you must clearly indicate the solution to the LP relaxation and the appropriate bounds. You must also clearly indicate the fathomed nodes and the reason for their fathoming and the final optimal solution