Prove that the following language is undecidable. L= {(M)|M is a TM and accepts at least one string of the form 1*0*1*} To do so: 1. Describe a reduction from ATM to L 2. Prove correctness of your reduction.