1) (5 points) Consider the problem G(b). For every value b with 0b16,G(b) denotes the following problem: maximizesubjectto6x1+4x2+15x3+3x43x1+1x2+3x3+1x4b0x12,0x23,0x31,0x44 3 i) (3 points) Code the LP using Gurobi, and solve it for b[[0,16]]. (A for loop in your code might make your life easier...) ii) (2 points) Let g() be the optimal value function. Graph g(b) for 0b16 using Python or Excel. ) (6 points) Give a simple algorithm for finding the optimal solution and optimal value of G(b). Your algorithm should compute g(b) correctly for 0b16. (You can describe the algorithm in a similar way to the algorithm you wrote for part b).)