(10 points) Give a description of a TM Ma that decides language A = {w over {0, 1}*| w contains twice as many 1's as O's}. For example, 101 A, 011 E A, and 001 A. (10 points) Give a description of a TM Ma that decides language A = {w over {0, 1}*| w contains twice as many 1's as O's}. For example, 101 A, 011 E A, and 001 A