i ask this question to be answered using spreadsheet please cause its my assignment which i want to submit. the answer can be send to oratilentsinyane@yahoo.com. if you have email please you can drop it to send clear assignment as pdf

Consider the below LP problem: MIN: 5X1 + 3X2 + 4X3 Subject to: X1 + X2 + 2X3 2 5X1 + 3X2 + 2X3 1 X1, X2, X3 0 (a) Solve this problem using the Simplex Algorithm (also known as the Simplex method) and present your final solution in a table, identifying all the possible sets of variables, the value of the objective function (feasible and non-feasible) at each of these variables? [22] (b) What is the optimal solution to this problem? (Hint use your answer in Q1 part a).