20pts ) Construct a nondeterministic FSA that recognizes the language generated by the regular rrammar G=(V,T,S,P), where V={0,1,S,A,B},T={0,1),S is the start symbol, and ={S1A,S1B,S0C,S0,S,A0B,A0,B1B,B0,B1,C0A}