Turing machine question:

Prove that language L = { | M enters state q3} is undecidable.

I'm not sure how to do a reduction proof for this, or if there's another way to tackle the problem.