Shop A provides 2 hours of cake training, 4 hours of cupcake training and 2 hours of bread training. Shop B provides 6 hours of cake training, 3 hours of cupcake training and 4 hours of bread training. Shop C provides 10 hours of cake training, 9 hours of cupcake training and 11 hours of bread training. Trainers must devote a minimum of 10 hours and a maximum of 36 hours to cake training, a maximum of 24 hours to cupcake training and a minimum of 15 hours to bread training. Shop A costs $85, Shop B costs $145, and shop C costs $175. The head chief aims to maximise the cost while satisfying the requirements of the three trainings respectively. Construct a table showing: ● ● the number of the elements required for each item the amount of each element available or the minimum requirements of each element. State the objective function and determine the constraints for each element. Produce a labelled graph showing the feasible region. Find the optimal solution by considering the feasible points. Determine the wastage or oversupply of elements for the optimal solution.

Hey I was Hoping if i could get some help with this question. Identify The variables X and Y: Find the objective Function: Graph The Constraints: Identify The vertices of the feasible region and their value

I tried putting the question in geoGebra but I can’t see the full/complete calculator input of that you put in GEOGEBRA. Please make sure the whole calculation is shown of what you put to get the graph because at the moment I can only see half of it. Also what are ALL the corner points for it so I can find optimal value and also the feasible region

The following is a description of the graph of a solution set to a system of inequalities. There is a dashed line with x-intercept ( 4 , 0 ) and y-intercept ( 0 , 3 ).  The region above this line is shaded. There is a solid line with x-intercept ( 1 , 0 ) and y-intercept ( 0 , 2 ). The region below this line is shaded.   Give the corrects  system of inequalities from the options above.