Problem 5 (3 points): Solve the following linear program using the simplex algorithm With Bland's pivoting rule. Start the algorithm at the extreme point a: = (2, 2, 0), with active set I = {3, 4, 5}. minimize $1 + $2 3:3 1 0 0 0 0 1 0 0 0 0 1 2:1 0 subject to 1 0 0 2:2 S 2 0 1 0 x3 2 0 0 1 2 1 1 1 4