g Let r and s be regular expressions over Σ = {a, b} and define new regular expressions as follows. (rs)* and r*s* Do (rs)* and r*s* define the same language? If they do, enter "YES." If they do not, give an example of a string that is in one of the languages but not the other. If (rs)* and r*s* define the same language, select the option that describes it. If they do not describe the same language, select the option that says so. The two regular expressions define the set of all strings obtained by concatenating a finite number of copies of "r*" with a finite number of copies of "s*." The two regular expressions define the set of all strings obtained by concatenating a finite number of copies of "(rs)*." The two regular expressions define the set of all strings obtained by concatenating a finite number of copies of "rs." The two regular expressions define the set of all strings obtained by concatenating a finite number of copies of "r" with a finite number of copies of "s." The two regular expressions do not define the same language.