Consider the following legitimate simplex tableau for a maximization problem. That is, it conforms all the rules aud provides a feasible solution. Let x4,x5, and x6 denote the slack variables for the first through third constraints. resnectivelv. a. (2 points) Identify the range for k. That is, what is the set of possible values for k ? Note that this tableau provides a feasible solution. b. (4 points) Clearly indicate which variables are basic and which are non-basic. Regarding the missing values in the objective function row (row zero), which of those can be known for certain? What are their values? c. (4 points) Define a range for d that forces x4 to enter the basis. Which variables can possibly leave the basis? d. (4 points) When x4 entens the busis, provide conditions that forces x3 to leave the basis. e. (2 points) In order for this table to be optimal, what should be the range for a throtigh f. f. (4 points) Identify the ranges for f and h which would make the problem unbounded. g. (4 points) Specify values for all variables (you can make thean up) that would provide an alternative optimal solution