Please solve linear programming problems thanks

Questions (1-4): For the linear programming problem given below, answer the following questions. maxz=x1+2x2+x3s.t.2x1+x22x34x1+2x2+x332x12x2+x35x1,x2,x30 1. After converting the linear programming model to the standard form, then the starting basic feasible solution in the simplex table is: 2. The basic and non-basic variables who will leave \& enter and become non-basic \& basic variables, respectively: A ] C L 3. The minimum ratio test will be: \begin{tabular}{|c|c|} \hline \multirow{4}{*}{ratiotest} \\ (4/1=4) \\ (3/2=1.5) \\ (5/2=2.5) \\ \hline \end{tabular} B \begin{tabular}{l} ratio test \\ (4/1=4) \\ (3/1=3) \\ (5/2 not \\ possible ) \\ \hline \end{tabular} \begin{tabular}{|c|} \hline ratio test \\ (4/1=4) \\ (3/2=1.5) \\ (5/2 not \\ possible) \\ \hline \end{tabular} D \begin{tabular}{l} ratio test \\ (4/2=2) \\ (3/1=3) \\ (5/2=2.5) \\ \hline \end{tabular} 4. Perform one iteration, then the value of the new basic variable and the objective function are: A I C D Question (5): For the linear programming problem given below, answer the following question. maxz=2x1+x2+3x3s.t.x1+x22x34x1+2x2+2x322x1x2+x33x1,x2,x30 5. In the standard form, if the basic variables are x2,s1,x1 then the solution is