Hi please make it fast i will like for the correct answer

2. Consider the feasible region shown below. Assume the origin (A) is feasible and the constraints are all constraints and the variables are all nonnegative. Suppose you wish to maximize 5x1+2x2+4x3 over this feasible region and you start at A. Which variable should enter the basis in the first iteration of the simplex algorithm if we wish to maximize the objection improvement after the first iteration? x1 anly x2 only x3 only x1,x2,orx3