Note: Enter your answer and show all the steps that you use to solve this problem in the space provided. Given the system of constraints, name all vertices of the feasible region. Then find the maximum value of the given objective function.

constraints
⎧
⎪
⎪
⎪
⎪
⎪
⎨
⎪
⎪
⎪
⎪
⎪
⎩
x
≥
0
y
≥
0
y
≤
1
3
x
+
3
5
≥
x
+
y
Objective Function:
C
=
6
x
−
4
y

true

step-by-step explanation:

you didn't give me the choices, so i will just give you the graph so you can look at your choices and choose the right one.

check above link.

graphically?   well, you graph them both, the solutions is where they both intersect each other, since there are two solutions, meaning they will meet twice, or namely the linear will run into the quadratic curve twice, and where they meet, those x,y coordinates are the solutions to the system.