please show all steps as i have no idea how. also solve all parts of the problem

Consider the following LP: maximizez=3x1+5x22x3s.t.5x1+x2+4x3403x1+7x2+2x384x2+5x35x1,x2,x30 (3.1) (10 points) Write the augmented form of this LP by introducing slack variables and get an initial basic feasible solution. (Suggestion only, but not necessary: Try to write in a matrix form!) (3.2) (12 points) Perform one complete iteration (From initial tableau to the next) of simplex algorithm in tabular form. Clearly state the variable entering the basis and the variable leaving the basis at the end of iterations 0 and 1 . Give the resulting basic feasible solution. (3.3) (3 points) is this solution after this itenation -Optimal