Make a conjecture whether or not the language is regular. Then prove your conjecture.

(g) L = {a"b' : In - 1= 2}