2. An investor can invest maximum B = 1000 in 3 projects. Each project i=1,2,3 has a price Pi and a revenue r; which are given in the following table: Investment 2 1 3 price (in ) revenue (in ) 750 200 800 20 5 10 The investor wants to take the investments of largest total revenue whose total price is not more than their budget B. Also, the investments are not divisible. (a) Write the linear programming problem specifying the objective function, decision variables and constraints. (b) Write a program in Xpress/IVE to solve the problem and present it clearly in your answers with annotations so that each step is clearly described (upload a file). (c) Determine which investments the investor will take. (d) State the optimum. Marks [50: 20(a), 15(b), 10(c), 5(d)]