Solve b and f

Exercise 4.1.1: Prove that the following are not regular languages. a) {0"1" | n > 1}. This language, consisting of a string of O's followed by an equal-length string of l's, is the language Loi 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. *c) {0"10" | n > 1}. d) {01m2" | n and m are arbitrary integers). e) {0"1" | n 1}