11. Additional Problem 5-11 For each of the regular expressions given below. Describe it as a set Describe it in English List 5 strings that are in that language Unless there are fewer than 5, in that case just list them all List 5 strings that are not in that language but still use the same alphabet Unless there are fewer than 5, in that case just list them all Make sure that lambda is included in one of the two lists above! a. a + b b. a + bc c. a + b* d. ab* + c e. ab* + bc* f. a*bc* + ac g. a*b* h. a* + b*