Step 1: In a Linear Programming Problem (LPP), if the objective function \( Z = ax + by \) has the same value at two corner points of the feasible region, then the maximum value of \( Z \) will occur at all points on the line segment joining these two corner points.
Step 2: Since the line segment contains infinitely many points, the number of points at which \( Z \) attains its maximum value is infinite.
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\).