1. Give simple description as possible of the languages denoted by the following regular expressions. For example, it is better to describe the language denoted by ((a*b*)*(b*a*)*)* as The set of all strings from the alphabet {a, b} rather than A sequence of 0 or more as followed by 0 or more bs, all repeated 0 or more times and then followed by etc. The latter might be correct but shows no thought.

a. (00|11)*((01|10)(00|11)*(01|10)(00|11)*)*