(10] For the following languages, indicate whether each one is regular. If the answer is positive, give a regular expression. If the answer is negative, provide a proof of the fact. Hint: For proving that a language is not regular, consider using the Pumping Regular Languages Lemma. (c) L3 C {0, 1) with |L3| S 3. (d) L4 (0129ki,j, k integers such that i + j + k 1} (e) L5 (0rn1n1m, n integers such that n m} 2] 2 2 2 2