To find the optimal solution to a linear programming problem using the graphical method, a. find the feasible point that is the farthest away from the origin. b. find the feasible point that is at the highest location. c. find the feasible point that is closest to the origin. d. None of these are correct.

Suppose you want to transform the graph of the function y=tan(x+pi/4)-1 into the graph of the function y=-tan(x+pi/2)+1 which transformations should you perform. a) reflect the graph of the first function across the x-axis, translate it pi/4 units to the left, and translate it 2 units up. b) reflect the graph of the first function across the x-axis, translate it pi/4 units to the right, and translate it 2 units up. c) reflect the graph of the first function across the line y = -1, translate it pi/4 units to the left, and translate it 2 units up. d) reflect the graph of the first function across the line y = -1, translate it pi/4 units to the right, and translate it 2 units up.