In a linear programming problem, the constraints on the decision variables x and y are 𝑥 − 3𝑦 ≥ 0, 𝑦 ≥ 0, 0 ≤ 𝑥 ≤ 3. The feasible region
(a) is not in the first quadrant
(b) is bounded in the first quadrant
(c) is unbounded in the first quadrant
(d) does not exist