User

You

Design a turning machine that reads that reads the strings in $\{$a$,$b$\}*$ delimited by the marker $ and does the following:

If the string between the markers ends with two consecutive a$$s tge machine accepts and write the letter Y after the second marker

Otherwise the machine rejects and writes the letter N after tge second marker

Clearly identify the start, accept, and reject states

The following are two examples that show the tape given as input to the machine $,$ the contents of the tape after the machine has reached a final state and if the machine accepts or rejetcts:

Input Output. Decision

$babaabab$ $babaabab$N$.$ reject

$babaabaa$$.$ $babaabaa$Y$.$ accept