Determine whether the following statements are True or False: A) The language corresponding to the regular expression 0*1*(0|1)*1* is the set of binary strings that start with 01 and end in 1 (True or...

Answer the following question accordingly:

Extracted text: Determine whether the following statements are True or False: A) The language corresponding to the regular expression 0*1*(0|1)*1* is the set of binary strings that start with 01 and end in 1 (True or False?) B) Suppose we have the following grammar, where a and b are terminal symbols, and S is a non terminal symbol: S : aaSbb | E The language described by this grammar would include the string "aaabbb". (True or False?) C) Suppose we have the following grammar, where a and b are terminal symbols, and S is a non terminal symbol: S : := aaSbb | bbSaa The language described by this grammar would include the string "aabbaabb". (True of False?)