In linear programming problem if all constraints are less than or equal to, then the feasible region is

• A. Above lines
• B. Below the lines
• C. Unbounded
• D. None of the above