2..- An investment firm is evaluating 4 different project investment alternatives. The required investment amounts in these projects, the "Net Present Value (NBV)" of the returns on the investments and the total investment budget available to the firm are given in the table below. Since it is not possible to make investments partially or more than once, solve this problem by programming according to the 0-1 integer programming model and applying the branch-bound algorithm. State clearly what your solution means (50 points). Projects Return on Investment Project 1 Project 2 Project 3 Project 4 Total Cash on Hand (TL) Required Capital Amount (TL) 200 150 400 150 (NBD-TL) 1000 1200 1800 1500 750 2..- An investment firm is evaluating 4 different project investment alternatives. The required investment amounts in these projects, the "Net Present Value (NBV)" of the returns on the investments and the total investment budget available to the firm are given in the table below. Since it is not possible to make investments partially or more than once, solve this problem by programming according to the 0-1 integer programming model and applying the branch-bound algorithm. State clearly what your solution means (50 points). Projects Return on Investment Project 1 Project 2 Project 3 Project 4 Total Cash on Hand (TL) Required Capital Amount (TL) 200 150 400 150 (NBD-TL) 1000 1200 1800 1500 750