prove that this machine accepts exactly what the language L.

L = {w {a, b} | there are no more than two (but there can be exactly two) as in a row and the number of bs is even}. Thus aabb is in, but baaaab and aba are not

96 95 4 b b 9 9 9 9 9 b o b a