Chapter 4 and Simplex Method Problem 1: Consider the following linear program: minimize 2a - 4b + 2c + d + 6e subject to: -2b + C + 2d + 2e = 1 4a-4b + e = 8 a, b, c, d, e 20 Using {a, c) as an initial BFS, make one pivot and bring non-basic variable d into the basis using the simplex method as taught in lecture. Be sure to clearly state what the starting basis {a,c} is equal to, the reduced cost, direction vector, step size, and new BFS