please help me out with these questions

QUESTION 1 Solve the following linear programming problem using the simplex method Maximize Z=R100X1+R60X2 subject to 4X1+2X2603X1+2X290X1,X20 QUESTION 2 A local shop sells specialty knives to knife enthusiasts. They have a substantial advertising budget of R50 000 to spread among four media channels: their recurring TV show, newspaper ads, radio spots, and social media. Leo, the owner, and star of the TV show is adamant that the show air at least three times a day, seven days a week but decides you can allocate the rest of the budget as you see fit. The TV shows draws 30,000 interested viewers per airing and costs R5,000 per episode. Daily newspaper ads cost R3500 and can be run up to seven days a week. Given the level of readership for newspapers, you settle on a figure of 15,000 people reached per ad. Radio spots come in 20 second and 30 second durations 20 second spots in drive time cost R2000 per airing and 30 second spots anyother time of the day are a relative bargain at R1500. Drive time spots (20 second durations) are available twice a day (morning and evening commute) five days a week and reach 12,000 people, and the "any other time" spots (30 second durations) could air up to six times a day seven days a week and reach 5,000 listeners per airing. The social media campaign is run out of a specialist's office and a burst of blogging, tweeting, vining and whatever else happens to be in fashion at the time costs R1800 and reaches 12,000 people. 2.1 What is the objective function and constraints if the problem is set up to determine the way to reach the most potential customers? 2.2 What is the objective function and constraints if the problem is set up to determine the way to minimize costs as long as 1,000,000 customers are reached QUESTION 3 Given the following LP formulation: To Maximize: 500X1+350X2+700X3+1000X4 Subject to: 5X1+5X2+6X3+8X44000X1+X2+X3+X44002X1+X2+2X3+X4300X42016X1+8X2+32X3+64X422,000X1+X2+2X3+4X410,000X1,X2,X3,X40 3.1 Use excel solver to solve the above linear programing problem. 3.2 Fully perform the sensitivity analysis of the solution. QUESTION 4 Solve the following linear programming problem using the simplex method: Minimize: Z=X1+2X2 subject to X1+3X28X1+2X23X1+2X2X2X1,X290160120700 NB: You must show all the steps when answering each