4 Problem Set 4 1. L2.3 {0,1}* be the language consisting of all bit strings with at least 2 zeros and at least 3 ones. Prove that this language L23 is regular. What is the number of states in the minimal (DFA)(hint: this number is equal to the number of distinct rows in the Myhill-Nerode matrix Tias). L2,3 2. Let L c10, 11* be some language. The lengths of all words in L are known to be squares of prime numbers. Is it true that such language L is always non-regular? (hint: not hard, pay attention to the text!)