Give English descriptions of the languages represented by the following regular expres- sions. Descriptions should be as simple as possible, but should avoid merely spelling out the conditions of the regular expression. As an example, if the regular expression is 0(0 + 1)*, an answer such as The language of all binary strings starting with 0 would be ideal, while "The language of all binary strings where the first symbol is 0 and it is followed by an arbitrary number of Os or 1s might receive less points. Both are technically correct, but the former is easier to comprehend. a) (0U 1)*1(0U 1) U (OU 1)*1(0U 1)(001) b) (a Ub Uc)*b(a Ub Uc)*c(a UbUc)* U (a UbUC)*c(a UbUc)*ba UbUc)*