Please help me understand!

Consider the following description of a language over the alphabet 2={a, b, c}: L = {W 2*] w begins with an a, contains exactly one b, and ends with cc} A. Define L using a recursive definition with a basis step and a recursive step. (20 points) B. Write down the regular expression (RE) for this language. (10 points) C. Use the function L: RE->RS to convert your regular expression to the associated regular set (RS). Show all the steps in your conversion. (10 points) Consider the following description of a language over the alphabet 2={a, b, c}: L = {W 2*] w begins with an a, contains exactly one b, and ends with cc} A. Define L using a recursive definition with a basis step and a recursive step. (20 points) B. Write down the regular expression (RE) for this language. (10 points) C. Use the function L: RE->RS to convert your regular expression to the associated regular set (RS). Show all the steps in your conversion. (10 points)