Which term best describes the number of solutions that will maximize the function below given the constraints listed? (Assume that x>0 ond y>0.)
x+2y<5. x-y<2 f(x, y) = 2x+y
a unbounded
b. one optimal solution
C. infeasible
d. alternate optimal solutions

Which two transformations are applied to pentagon abcde to create a'b'c'd'e'? (4 points) translated according to the rule (x, y) ? (x + 8, y + 2) and reflected across the x-axis translated according to the rule (x, y) ? (x + 2, y + 8) and reflected across the y-axis translated according to the rule (x, y) ? (x + 8, y + 2) and reflected across the y-axis translated according to the rule (x, y) ? (x + 2, y + 8) and reflected across the x-axis