Linear programming

Maximise $2x + 3y$ subject to $x + y\le4$, $x + 3y\le6$, $x, y\ge0$. (a) List the vertices and find the optimum. (b) Write the dual and solve it using complementary slackness. (c) Check the optimal values agree.