Give a polynomial time algorithm that decides if such an arrangement is possible. You can use any algorithm we developed in class as a black-box. (25, Linear programming) Solve the following linear program graphically: Maximize x+3y, subject to a) 5y3x20, b) x+y3, c) x3y6, d) 2y+3x29, e) x0, f) y0