Which of the following languages are regular, and which are not? To show a language is regular, give a DFA, NFA, or regular expression for it. To show a language is not regularprove it using the pumping lemma or using pairwise distinguishable strings. (a) L = {1717 | n > 0} (b) L2 = {1m012 | m > 0, n = 0, Im > n} (c) L3 = {we {0, 1}* |w has the same number of occurrences of 00 and 11} Note: 000 has two occurrences of 00 (d) L4 = {w {0, 1}* | w has the same number of occurrences of 010 and 101} Note: 01010 has two occurrences of 010 and one occurrence of 101