3. (9 points) Give a Turing machine that decides the language over the alphabet = {a,b,c}: L = {ab2ici | i >0}. That is, it should accept if the input is in L, and reject otherwise. You should provide a brief justification / high level description of what the machine does. Then you should explicitly state the tape symbols, and provide the states and transitions (ideally via a state diagram). Feel free to use any short hand notation for the state diagram, such as not putting the new symbol if it's unchanged, and having all unspecified transitions go to qreject