Please answer quick!

01. 120 points Solve partially the following linear program using the Simplex Algorithm - Dictionary Method (Phase IT), Maximize Z = 3x2 + 2x2 Subject to: 6x + 332 s 24 2x, + 3x2 s 12 3x2 9 X, X2 2 0 MN By answering the following questions: a) Write the Augmented LP problem. b) Write the Basic Set (B) and the Non-Basic Set (NB) of the first Dictionary of the LP problem. c) Write the first Dictionary of the LP problem d) Write your checking of dz/dNB, to show if you need to improve the value of Z. c) If there is an improvement for the Z value, show all your calculations to choose one of the NB variables to enter the Basic set (B). f) If there is an improvement for the Z value, write the new Basic Set (B) and the new Non-Basic Set (NB). g) If there is an improvement for the Z value, write the second Dictionary of the LP