Given the following linear programming problem,

Maximise $z = 3x_1 + 4x_2$

Subject to

$2x_1 + x_2 \leq 6$

$2x_1 + 3x_2 \leq 9$

$x_1 \geq 0, x_2 \geq 0$

the corner point feasible solution in terms of $(x_1, x_2)$ is