suppose l is the language accepted by the DFA M picture (with start state q1 and consider the homomorphism

Suppose C is the language accepted by the DFA M pictured (with start state g) and consider the homomorphism f : {0,1}* {a,b)' defined by WI f(0) = abb , f (1)-baa . (a) Construct a DFA that accepts f-1(C) (b) Construct a regular expression that denotes f(0"1 +01*0) 2 (c) Construct a regular expression that denotes f()