answer all parts

1. Book Section 11.1 Problem 1 (p. 7470) Find a language (i.e., a set of strings) to describe each of the following regular expressions. c. a+b d. ab+c e. ab+bc f. abc+ac 2. Book Section 11.1 Problem 2 (p. 747) Find a regular expression to describe each of the following languages. c. {a,b,ab,ba,abb,baa,,abn,ban,} d. {a,aaa,aaaaa,,a2n+1,} f. {,a,b,c,aa,bb,cc,,an,bn,cn,} i. {ambcnm,nN}