8. \begin{figure}[h] \end{figure} A company makes two types of garden bench, the 'Rustic' and the 'Contemporary'. The company wishes to maximise its profit and decides to use linear programming. Let \(x\) be the number of 'Rustic' benches made each week and \(y\) be the number of 'Contemporary' benches made each week. The graph in Figure 6 is being used to solve this linear programming problem.
Two of the constraints have been drawn on the graph and the rejected region shaded out.

1. Write down the constraints shown on the graph giving your answers as inequalities in terms of \(x\) and \(y\). It takes 4 working hours to make one 'Rustic' bench and 3 working hours to make one 'Contemporary' bench. There are 120 working hours available in each week.
2. Write down an inequality to represent this information. Market research shows that 'Rustic' benches should be at most \(\frac { 3 } { 4 }\) of the total benches made each week.
3. Write down, and simplify, an inequality to represent this information. Your inequality must have integer coefficients.
4. Add two lines and shading to Diagram 1 in your answer book to represent the inequalities of (b) and (c). Hence determine and label the feasible region, R. The profit on each 'Rustic' bench and each 'Contemporary' bench is \(\pounds 45\) and \(\pounds 30\) respectively.
5. Write down the objective function, P , in terms of \(x\) and \(y\).
6. Determine the coordinates of each of the vertices of the feasible region and hence use the vertex method to determine the optimal point.
7. State the maximum weekly profit the company could make.
   (Total 16 marks)