1. Consider the following Linear Programming Problem (LPP). [16 points@8pts for each method] A) Convert LPP into its standard form using Simplex Method and create the initial simplex table. B) Convert LPP into its standard form using Big M Method and create the initial simplex table. C) Calculate Zj values and CjZj values for both methods. Analyze whether you reached optimality or not. maxZ=5x1+4x2Subjectto6x1+4x224x1+2x26x1+x21x22x1,x20 [Rubric: 8 Pts 3 Pts for standard form of LPP, 2 points for initial table, 3pts where 2pts@ 1 pt for Zj and 1pt for Cj calculations and 1 points for analysis] 1. Consider the following Linear Programming Problem (LPP). [16 points@8pts for each method] A) Convert LPP into its standard form using Simplex Method and create the initial simplex table. B) Convert LPP into its standard form using Big M Method and create the initial simplex table. C) Calculate Zj values and CjZj values for both methods. Analyze whether you reached optimality or not. maxZ=5x1+4x2Subjectto6x1+4x224x1+2x26x1+x21x22x1,x20 [Rubric: 8 Pts 3 Pts for standard form of LPP, 2 points for initial table, 3pts where 2pts@ 1 pt for Zj and 1pt for Cj calculations and 1 points for analysis]