please solve the following question?

Exercise 3. [2!] points) Consider the phase 1 set of equations: $1 423334 $2: 3IBI4 1!: 1534-34 w: 1+:rs:l-'4 where the 4 JI-variables are variables in the original problem1 a is an articial variable and w is the variable corresponding to the objective function in phase 1 of the simplex algorithm. (a) (3 points) Give the basic solution associated with this set of equations and state whether or not it is feasible to the original problem. {b} [3 points) What does the phase 1 simplex algorithm do next {if anything] in terms of specifying entering and leaving variables. {c} (3 points) Give the next set of equations (if needed) and the associated basic solution and state whether or not it is feasible to the original problem. {d} (3 points] In the original problem the objective function is 2:11 +r2+r3+r4. State whether or not the basic solution obtained in part (c) is optimal for this objective function. (e) [5 points) State the full original problem. Note that it has 4 nonnegative variables and three equality constraints. [f] [3 points] Give all of the extreme points to the original