Please answer question #1 part A and part B showing all work

IEEN 5335 - Optimization Assignment 3 Due: 10/15 Note: . This work should be done individually! If works are similar or same each other, all parties will receive zero credit. No excuses! 1. Use Graphical method and Simplex algorithm (method) to solve the following LP problems Solve the problem using the graphical method. Solve the problems using Simplex and show the step by step procedure as seen in the lecture note. Mark the point on the graph for the 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. 2x1 + 2x2 xl + 7x2 a) Max s.t. b) Max s.t. 2x1 + 5x2 = 0 x1, x2 >= 0 2. LP modeling - Political campaign Assume that you are working for an election campaign. As a common knowledge, the more money you spend on advertising, the more votes you get. You want to advertise your candidate's policy so that as many as people can watch the ads with limited budget. Your camp assigned $1,000,000 for advertising budget. The following table shows TV stations, time and number of viewers/advertisement costs for different time for different TV station. All units are in 1,000. TV stations time CNN NBC morning 80 / $100 55 / $50 afternoon 60 / $80 20 / $20 evening 90 / $120 65 / $60 For each station, the available time slots (# of available advertisements) are 5, 12 and 3 for morning, afternoon and evening, respectively