a. 2x – 5y >3 b. 3x – 7y ≤4 c. 5x + 3y ≥1 d. X – 6y ≥2 2. Graph the ff: in one cartesian plane, find the feasible region (select darkest color for region of the set of solutions) a. Constraints: 4x – 3y ≤1 3x + 2y ≥1 y ≤1 x ≥0 3. Referring to problem no.2, find the minimum and maximum values of the objective function: Z = 2x – y