How do you prove that this TM decides a language that is undecidable?
Hint: The exact definition of $A$ is not important; you just need $A \neq \Sigma^*$. When is $L(R) \neq A$? (look at the third line!)