5. Here are seven regular expressions: ! . (0%+10%)* 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*+10)* and (0+1*)* b) (0+10)* and (0*+10)* c) (0+1*0)* and (0*+1*)* d) (0+)* and (0+1*O)* 6. Consider the languages (a) (02n]n I n>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) {wlw a string of O's and 1's such that its length is a perfect square] (f) (w l w string of 0's and 1's such that when interpreted as a binary integer it i:s not a multiple of 5) (g) fw l w a string of O's and 1's such that its length is not a perfect cube) (h) sw l w a string of O's and 1's such that the number of O's is not equal to twice the number of 1's) Which is a regular language ! a) (c) b) (h) c) (e) d) (d)