A furniture trader deals in only two items - chairs and tables.
He has Rs. 50, 000 to invest and a space to store at most 35 items.
A chair costs Rs. 1000 and a table costs Rs. 2000.
The trader earns a profit of Rs. 150 on a chair and Rs. 250 on a table.
Choose the correct option that describes the given linear programming problem (LPP) to maximize the profit, where \(x\) and \(y\) are the number of chairs and tables.

1. A Maximize \(Z=150 x+250 y\),
   Subject to constraints,
   \(x+y \leq 35, x+2 y \geq 50, x \geq 0, y \geq 0\)
2. B Maximize \(Z=150 x+250 y\),
   Subject to constraints,
   \(x+y \leq 35, x+2 y \leq 50, x \geq 0, y \geq 0\)
3. C Maximize \(Z=150 x+250 y\),
   Subject to constraints,
   \(x+y \geq 35,2 x+y \leq 50, x \geq 0, y \geq 0\)
4. D Maximize \(Z=150 x+250 y\),
   Subject to constraints,
   \(x+y \geq 35,2 x+y \geq 50, x \geq 0, y \geq 0\)