I need all of them to be solved please. Thanks

Give a grammar G = (V, sigma, S, P), where V = {A, B, C}, sigma = {a, b}, S = A, P: A rightarrow bB|aA, B rightarrow aC|bA|bB, C rightarrow bC|lambda. (a) Is G a regular grammar? Why? (b) Find an nfa which accepts the language L(G). (c) Find the regular expression r associated with the language accepted y the above nfa. (d) Find regular language L(r) from the above r. Consider a set of symbols sigma = {0, 1}. (1) Find all strings in sigma* shorter than 3. (2) Let L = {lambda, 0, 10}. Is L a language on sigma? Why? (3) Write L^and L^Let sigma = {a, b}. What language do the following grammar generated? Write the languages. S rightarrow AB (1) A rightarrow aAb/lambda B rightarrow Bb/lambda S rightarrow alpha AB (2) A rightarrow baA/ba B rightarrow Bb/lambda (1) Find a grammar that generates languages L = {a^m b^n: m, n greaterthanorequalto 0}. (2) Find a grammar that generates languages L = {b^m+2 a^n: n greaterthanorequalto 0}. Find a grammar that generates languages L = {b^m a^n: m greaterthanorequalto n}