For the feasible region shown below, the non-trivial constraints of the linear programming problem are 
For the linear programming problem: \[ {Maximize} \quad Z = 2x_1 + 4x_2 + 4x_3 - 3x_4 \] subject to \[ \alpha x_1 + x_2 + x_3 = 4, \quad x_1 + \beta x_2 + x_4 = 8, \quad x_1, x_2, x_3, x_4 \geq 0, \] consider the following two statements:
S1: If \( \alpha = 2 \) and \( \beta = 1 \), then \( (x_1, x_2)^T \) forms an optimal basis.
S2: If \( \alpha = 1 \) and \( \beta = 4 \), then \( (x_3, x_2)^T \) forms an optimal basis. Then, which one of the following is correct?
A racing track is built around an elliptical ground whose equation is given by \[ 9x^2 + 16y^2 = 144 \] The width of the track is \(3\) m as shown. Based on the given information answer the following: 
(i) Express \(y\) as a function of \(x\) from the given equation of ellipse.
(ii) Integrate the function obtained in (i) with respect to \(x\).
(iii)(a) Find the area of the region enclosed within the elliptical ground excluding the track using integration.
OR
(iii)(b) Write the coordinates of the points \(P\) and \(Q\) where the outer edge of the track cuts \(x\)-axis and \(y\)-axis in first quadrant and find the area of triangle formed by points \(P,O,Q\).