For the Following Linear Programming Problem, Determine the Optimal Solution $\le$

For the following linear programming problem, determine the optimal solution by the graphical solution method. Are any of the constraints redundant? If yes, then identify the constraint that is redundant.
Max
X + 2Y
s.t.
X + Y $\le$ 3
X- 2Y $\ge$ 0
Y $\le$ 1
X , Y $\ge$ 0