(a) Let V={S,A,B,a,b} and T={a,b}. Find the language generated by the grammar (V,T,S,P)) when P consists of SAA,SB,AaaA,BBB,Aaa,Bb (b) Consider the finite-state automaton M={S,I,f,S0,F) defined by the following transition diagram. a). Find the states of M. b). Find the input alphabet of M. c). Find the initial state of M. d). Find the transition function of M. c). Find the final acceptance states of M