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

Which of the following would be a correct step in proving that triangle abc is congruent to triangle cda? a. use a protractor to measure the angles and show that all the corresponding angles are equal in measure. this will allow you to prove congruence by aaa. b. show that segment ab is parallel to segment cd and segment ad is parallel to segment cb. this will allow you to prove congruency by asa. c. show that is segment ab is perpendicular to segment ad. this will allow you to prove congruence by sas. d. none of the above.