need urgent?

1. (100 pt) For the following five languages, what automata can be used to describe them? Fill the entire table with Yes/No and pick two languages to prove your claims. For each language in your proof, you must prove claims for each automaton to get the full credit. The table is worth 20 pts and each proof 40pts. 1. L1={1n02nn1}. 2. L2={0n1n2nn1}. 3. L3={w{0,1}w is not accepted by the TM whose binary encoding is w}. 4. L4={w{0,1}w is accepted by the TM whose binary encoding is w}. 5. L5={0n1k2mk,m,n1}. 6. L6={0n10n1n1}. 7. L7={1n010mm,m1}. 8. L8={w{0,1} TM encoded by w will halt on any input }. 9. L9={0n1m0m1nm,n1}