Solve the following linear programming problem using the Simplex and graphicall method for the optimal solution to the following Iinear programming problem: min Z=6x₁+3x₂ S.t. 2x₁+4x₂ ≥16 4x₁+3x₂ ≥24 X₁,X₂≥0​