Draw a finite automata over alphabet {a, b} for
{ w | every letter in w is either preceeded or followed by the sameletter}


For example aab and aabaa are not in the set because the b isneither preceeded nor follwed by another b,
but aabb, aaa, bbaabbb are in the set.