A small unit makes desk lamps and wall lamps. Each day it makes desk lamps and wall lamps. Its assembly time and its testing time are both limited, and these two limits, together with and , give the shaded feasible region shown below. The boundary line (assembly) passes through and , and the boundary line (testing) passes through and . The lines cross at the vertex . The unit earns ₹50 on a desk lamp and ₹40 on a wall lamp, and it can sell everything it makes.

Attempt any four of the following five sub-questions.
(a) Find the equations of and , and write the two constraints which, together with and , describe .
(b) Find the coordinates of .
(c) Find the number of lamps of each kind the unit should make to maximise its profit, and the maximum profit.
(d) A shop orders desk lamps and wall lamps for delivery at the end of one day. Can the unit make them in a single day? Justify.
(e) Suppose the profit on a wall lamp changes to ₹, while the profit on a desk lamp stays ₹50. Find the value of for which the maximum profit is obtained both at and at the vertex .
