SOLVE ALL PARTS AND PROVIDE VALID SOLUTIONS. thanks

Consider the following Linear Program (LP): MAXZ=5x1+6x2 subject to: 5x13x215(Constraint-A)2x1+4x29(Constraint-B)2x1+5x214(Constraint-C)2x1+x212(Constraint-D)x10,x20 1) Apply the Exhaustive Enumeration method to obtain the Optimal Solution for the above LP.Show complete working. (20 marks) 2) Use the Tabular Form of SIMPLEX method to obtain the Optimal Solution for the above LP.Show complete working. (20 marks) 3) Evaluate the pros and cons of each of the above two methods in: (10 marks (a) obtaining the optimal solution for the given LP (b) obtaining the optimal solution for any LP in general