With linear utility U=x+4y, MUx=1 and MUy=4 (constants).
Compare marginal utility per rupee:
PxMUx=21=0.5,PyMUy=34≈1.33
Since PyMUy>PxMUx, pudding gives more utility per rupee spent — with perfect-substitutes preferences like this, Trisha wants to spend as much as possible on pudding first.
Without the quantity cap, she would spend her entire ₹120 income on pudding alone: 120/3=40 units of y. But the quantity constraint caps pudding at 30 units — so this cap binds before the budget does.
Applying the binding cap: buy the maximum allowed 30 units of pudding, costing 3×30=90. Remaining income: 120−90=30. Spend the rest on biryani: 30/2=15 units of x — well under its own cap of 60, so the biryani cap is not binding.
Therefore the optimum bundle is (x∗,y∗)=(15,30), matching option (B).
The trap:
(D) (x∗,y∗)=(60,0)Students who correctly identify that pudding is preferred per-rupee might jump straight to the 'corner solution' answer of spending everything on the OTHER good's cap ((D), all biryani) by confusing which good the linear utility function actually favors, or might forget to check the quantity cap at all and compute the unconstrained optimum (which would be all pudding, 40 units — not even listed as an option, since it violates the cap), missing that the specific binding constraint here is the quantity cap on pudding, not the plain budget line.