Problem 3 (8 marks) Any set of words is called a language. For example {00, 101,011} and {W: we {0,1}*, |w| is even} are two languages, such that the first one is finite, and the second one is infinite and consists of all binary words of even length. Indicate whether each of the following languages over the alphabet {0,1} is finite or infinite no explanations required. If the language is finite, tell how many words it contains. = 1. L1 = {0, 11}* 2. L2 = {0, 1}* L1 3. L3 = {0, 1311 U {0}1040 4. L4 = {w | w contains exactly 7 1's} 5. L5 = {w | w contains no 00} 6. Lo = {w | w contains at most 8 O's} n L4 = =