Convexity facts in linear programming

Which of the following statement(s) is/are true for an LP problem? (I) The set of all feasible solutions to an LP problem is a convex set. (II) Every hyperplane is a convex set.