Step 1: Sharing the Good \( y \). Since Anil and Binod decide to share good \( y \) equally, each person receives half of the total available quantity of good \( y \). The total quantity of good \( y \) is 100, so each person will receive: \[ y_{{Anil}} = y_{{Binod}} = \frac{100}{2} = 50 \] Step 2: Maximizing Utility Using the Budget Constraint. The total quantity of good \( x \) is 50, so Anil and Binod together must share the total available amount of good \( x \). Let \( x_{{Anil}} \) be the amount of good \( x \) that Anil receives. The remaining amount of good \( x \), \( x_{{Binod}} \), is then: \[ x_{{Binod}} = 50 - x_{{Anil}} \] Next, we need to maximize their utility functions subject to the budget constraint. The general utility maximization problem involves setting up a Lagrangian function. We want to allocate goods \( x \) and \( y \) between Anil and Binod in such a way that their marginal utilities are proportional to the price ratio.
Step 3: Utility Maximization and Solution. The solution to this problem can be derived by maximizing the utility functions subject to the budget constraint. After solving, we find that the optimal allocation of good \( x \) for Anil is: \[ x_{{Anil}} = 21 \]
Here are two analogous groups, Group-I and Group-II, that list words in their decreasing order of intensity. Identify the missing word in Group-II.
Abuse \( \rightarrow \) Insult \( \rightarrow \) Ridicule
__________ \( \rightarrow \) Praise \( \rightarrow \) Appreciate
The 12 musical notes are given as \( C, C^\#, D, D^\#, E, F, F^\#, G, G^\#, A, A^\#, B \). Frequency of each note is \( \sqrt[12]{2} \) times the frequency of the previous note. If the frequency of the note C is 130.8 Hz, then the ratio of frequencies of notes F# and C is: