1.Show that EQCFG is undecidable.

2.Show that m is a transitive relation.

3.Show that if A is Turing-recognizable and A m A, then A is decidable.

4.Let T = {M| M is a TM that accepts w^R whenever it accepts w}. Show that T is undecidable.