Consider the following linear program models in \#1 and \#2. a) Solve the problem using the graphical method. b) Solve the problems using Simplex and show the step by step procedure as seen in the lecture note. c) Mark the point on the graph for each simplex step's output as seen in the lecture note. - I don't need software output, but you may check your output with software result. - You may use Excel for your convenience. 1. Maxs.t.21+52=021+52 2. Maxs.t.1x1+x2=0