To determine which half-plane contains the solutions, use a test point not on the boundary line. If the test point satisfies the inequality, shade that half-plane. The point (0,0) is a good test point when available.
For 3y+xβ₯β9, test (0,0): 3(0)+0β₯β9β0β₯β9. This is true, so shade the half-plane containing (0,0).
For y>4x+2, test (0,0): 0>4(0)+2β0>2. This is false, so shade the half-plane that does not contain (0,0).
Think of the test point as a secret agent. You send the easiest agent, (0,0), into one of the half-planes. If it reports back 'True,' that whole region is the solution, and you shade it in! If it reports 'False,' you know the solutions are all hiding in the other half-plane, so you shade that one instead.