Solve part a & b

a) (5 points) For every value b with 0b10,F(b) denotes the following problem: maximizesubjectto6x1+4x2+2x3+x4x1+x2+x3+x4b0x12,0x23,0x31,0x44 i) (3 points) Code the LP using Gurobi, and solve it for b[[0,10]](={0,1,2,3,,10}). (Remember to upload every code you write with your problem set.) ii) (2 points) Let f() be the optimal value function. That is, f(b) is the optimal value when the right-hand side is b. Graph f(b) for 0b10 using Python or Excel. Hint: use a Scatter Plot with Straight Lines and Markers (5 points) Give a simple algorithm for finding the optimal solution and optimal value of F(b). Your algorithm should compute f(b) correctly for 0b10. (You can describe the algorithm using Python or any other language. Or you can simply use pseudo-code. All we really want is for you to be able to describe how to find the optimal solution in a way that is understandable. Accordingly, we will be lenient in grading this part.)