A media agency wishes to hire two employees, Jeremy and William, to prepare advertising campaigns for their clients. Jeremy can prepare 26 campaigns per day and earns $151 per day, while William can prepare 29 campaigns per day and earns $150 per day. William can only be employed for up to 5 days of the week due to a medical condition. Additionally, due to labor union regulations, Jeremy can be hired for no fewer days than William. If the media agency has at least 107 campaigns each week, how many days per week should the office employ each intem to minimize its costs? a. Identify and clearly define the variables needed to solve the linear programming problem. 2 CEE b. Objective function: (Hint: Your equation must be written in the form M-, where the variable you are maximizing or minimizing is on the left side of the equal sign.) . Subject to: (Hint: Write the constraints line by line. Separate the non-negativity constraints with commas) (Campaign constraint) (William medical condition constraint) (William vs Jeremy work constraint) (Non-negativity constraints) A media agency wishes to hire two employees, Jeremy and William, to prepare advertising campaigns for their clients. Jeremy can prepare 26 campaigns per day and earns $151 per day, while William can prepare 29 campaigns per day and earns $150 per day. William can only be employed for up to 5 days of the week due to a medical condition. Additionally, due to labor union regulations, Jeremy can be hired for no fewer days than William. If the media agency has at least 107 campaigns each week, how many days per week should the office employ each intem to minimize its costs? a. Identify and clearly define the variables needed to solve the linear programming problem. 2 CEE b. Objective function: (Hint: Your equation must be written in the form M-, where the variable you are maximizing or minimizing is on the left side of the equal sign.) . Subject to: (Hint: Write the constraints line by line. Separate the non-negativity constraints with commas) (Campaign constraint) (William medical condition constraint) (William vs Jeremy work constraint) (Non-negativity constraints)