Solve the following linear programming problem using Simplex method. Maximize Z=2x1−3x2+6x3 subject to 3x1−x2+2x3≤7 2x1+4x2≥−12−4x1+3x2+8x3≤10x1≥0x2≥0x3≥0