Prove that the following languages are not regular. L = {a^nb^la^k: k > n + 1} L = {w: n_d(w) notequalto n_b (w), w {a, b}*} Determine whether or not the following languages are regular. Explain L = {a^nb^n: n > 0} {a^k b^m: k > 0, m > 0} L = {a^nb^m: n, m lessthanorequalto 2n}