4. Consider the language L consisting of binary strings with the same number of O's and ls. (a) Prove that L is not regular using pumping lemma. (b) Prove that L is not regular using the closure properties of regular languages. (Hint: use the fact that {Ok1k|k > 0} is not regular.]