1. Show how the following Turing Machine M accepts or rejects this string: aabbbcccccc. M decides the language C ab li x j kand i,j,k si) (a) M- "On input string w: i. Scan the input from left to right to determine whether it is a member of atbtct reject if not. ii. Return the head to the left-hand end of the tape. iii. Cross off an a and scan to the right until a b occurs. Shuttle between the bs and cs, crossing off one of each until all bs are crossed off. If all cs have been crossed off and some bs remain, reject. iv. Restore all the crossed off bs and repeat Step ii if there is another a to cross off. If all as have been crossed off, determine whether all cs also have been crossed off. If yes, accept; otherwise reject." 1. Show how the following Turing Machine M accepts or rejects this string: aabbbcccccc. M decides the language C ab li x j kand i,j,k si) (a) M- "On input string w: i. Scan the input from left to right to determine whether it is a member of atbtct reject if not. ii. Return the head to the left-hand end of the tape. iii. Cross off an a and scan to the right until a b occurs. Shuttle between the bs and cs, crossing off one of each until all bs are crossed off. If all cs have been crossed off and some bs remain, reject. iv. Restore all the crossed off bs and repeat Step ii if there is another a to cross off. If all as have been crossed off, determine whether all cs also have been crossed off. If yes, accept; otherwise reject