Please answer all of them. Thank you! I will rate you nicely.

Exercise 4.1.1: Prove that the following are not regular languages. a) (0"1 I n This language, consisting of a string of O's followed by an equal-length string of 1's, is the language Lo we considered informally at the beginning of the section. Here, you should apply the pumping lemma in the proof. b) The set of strings of balanced parentheses. These are the strings of char acters " and ")" that can appear in a well-formed arithmetic expression c10" n 2 1) m are arbitrary integers) f) 10"12n n2 1)