The following tableau represents a specific simplex iteration for a maximization problem. All variables are nonnegative. Basic f Xg X3 X1 X1 0 0 0 1 X2 -5 3 1 -1 X3 0 0 1 0 X4 4 -2 3 0 X5 -1 -3 1 6 X6 10 -1 0 -4 X7 0 5 3 0 Xg 0 1 0 0 Solution 620 12 6 0 Use the table to answer the following: a) [4pt] Categorize the variables as basic and non-basic and provide the current values of all the variables and the value of the objective function at this iteration. (e.g., Basic variables are ..., and non-basic variables are ..., X1 =..., *2 =..., ..., Xg =..., & f =...) b) [2pt] Is the current solution optimal (i.e., did Simplex converge)? Why/Why not? c) [4pt] Identify all non-basic variables that have the potential to improve the objective function, and if that variable enters the basic solution, determine the corresponding basic variable to leave the solution