9.9. Construct a reduction from Accepts-$\lambda$ to the problem Accepts-$\{\lambda\}$: Given a TM $T$ , is $L(T) = \{\lambda\}$?The question is from Martin's Introduction to Languages and Theory of Computation.I know how reductions work though I am unsure of several things. It's easy to see that if the inner machine (computing accepts-$\{\lambda\}$) accepts then the outer must also accept, but it is not clear that the other goes as well. How do I ensure this? 
reduction from the problem accepts-empty string to language of empty string
computability;turing machines;reductions;undecidability