i am looking for the logic not the code.

Give a right-linear grammar and left-linear grammar for the following language: {b^n ab^m a: n greaterthanorequalto 2, m greaterthanorequalto 2} Demonstrate that, if L_1 is a regular language on the alphabet sigma = {a, b}, then the following subset of L_1 is also regular language: L_2 = {w: w elementof L_1 and w includes at least one b} Argue that the language: L = {a^n b^2n: n greaterthanorequalto 0} is not regular