Solve the following linear programming problems by the graphical method and the simplex method, respectively. (1) Indicate whether the problem has a unique optimal solution, an infinite number of optimal solutions, an unbounded solution, or no feasible solution;

(2) When there is a finite optimal solution, indicate which vertex of the feasible domain in the graphical method corresponds to each of the base feasible solutions in the simplex table.

(1) min z=21 +3x2 (2) max z= 3x1 + 2x2 4x1 +6 2 26 2 21 + 2 2 2 s. t.