Let sigma = {0, 1}. Listed below are ten regular expressions, each describing one of five different languages. Pair the equivalent regular expressions and briefly express the language they describe in English. You do not need to justify why the regular expressions describe this language for this question. One pair is done for you as an example. A. (10)* Union (01)* Union (1 (01) * 001) B. (0 Union 1)* C. 0 (10)* 1 Union epsilon D. ((01)* Union (10)*) (01 Union epsilon) E. (01)* Union 01 (01)* 01 F. (0* 10)* G. (0 Union 10)* 10 Union epsilon H. 0* (0* 10* 10*)* I. (0* 1*) * J. (0* 10* 1)* (0 Union epsilon)* Example B. and I. both represent the same language, the language of all strings over {0, 1}