Exercise 2) For each of the following languages determine whether the given language is regular or not. Justify your answers. Use the pumping lemma to prove that some language is not regular please do all parts,thanks h) {w {a, b}* | w=wR} j) (www (a, b)"} 1) {w E {a,b)* ||wla - full > 100} m) (w E {a,b}" ||wlalwlo > 100} n) (w e {a}* I lwl is a prime}