5. Which of the following strings is NOT in the Kleene closure of the language (011, 10, 110)? a) 10111011 b) 011011110 c) 10110011 d) 1001110 6. Here are seven regular expressions: 2. (0+10)* 3. (0*+10)* Determine the language of each of these expressions. Then, find in the list below a pair of equivalent expressions a) (0+1*0)* and (O*+1*)* b) (0+1*0)* and (0+1*)* c) (0* +10*)* and (0+10)* d) (0+10)* and (0*+10)* 7. Consider the languages (a) (02n1n In>0) (b) (05n1" In> 0) (c) {w l w a string of O's and 1's such that when interpreted in reverse as a binary integer it is a multiple of 5) (e) {w l w a string of 0's and 1's such that its length is a perfect square) (f) fw l w string of O's and 1's such that when interpreted as a binary integer it is not a multiple of 5) (g) {wl w a string of O's and 1's such that its length is not a perfect cube) (h) (w l w a string of 0's and 1's such that the number of O's is not equal to twice the number of 1's)