(a) Build a Transition Graph for the language L, defined over S = {a,b}, of all non-empty strings having only b at odd clumps (however both a and b can occur at even clumps, but the odd clumps should only be occupied by b).

here is its FA:

(b) Draw the Transition Graph for the language L defined over S = {x,y} accepted by given RE: (x+y)* (xx+yy) (x+y)*

here is its FA:

(c)Build a Transition Graph for the given Regular Expression. (a + aab)* b

here is its FA:

a,b a,b Start a,b