Given the system of constraints, name all vertices of the feasible region. then find the maximum value of the given objective function. show all the steps that you use to solve this problem.

11/36 is .305 repeating

First step is to get rid of the square root. remember that a square root is the same as raising to the (1/2) power. see below: multiply exponents per exponent rules to get: remember you subtract exponents from the denominator and add exponents in the numerator so: simplify further: so a is the correct choice. if you don't understand this google exponent rules and it will you understand. look at the image results.