it's related to theory of Automata

I: Alphabet S = {a,bc,cc} has number of letters. i: One ii: Two iii: Three iv: Four II: In which of the following language Rev(s) =s i: EQUAL ii: INTEGER iii: PALINDROME iv: FACTORIAL III: If S = {ab, bb), then S* will not contain i: abbbab ii: bbba iii: bbbbab iv: abab (b): I: Consider the language S*, where S= { ab , ba }, Can any word in this language contain the substrings aaa or bbb? Why or why not? II: Let P= { ab, bb } and let Q= { ab, bb, bbbb } show that P*=Q)*. III: Let R= { ab, bb } and let V= { ab, bb, bbb } show that R* not equal V*. (c): Kleene's theorem part II (method with different steps), to determine corresponding Regular Expression s,(RE) from the given TGs. aa,bb aa,bb ab,ba +1 ab.ba