(a) {banbm n≥ 3, m ≥ 2}. : (b) {w € {a,b}* : every maximal substring of w consisting entirely of symbols a is of length exactly 3}. (c) {wЄ {a,b}* : w does not contain bab as a substring}. (d) {w€ {a,b}* : w begins with bb and nɩ(w) mod 3 = 0}.

Determine whether some C compiler to which you have access implements the free function.

(IV) Give regular expressions for the following: L = {anbm | n ≥2, m <4} (i) Give two strings that are in the language. (ii) Give the regular expression for the complement of the above language.

2. Find a regular expression to describe the given language: { bc, b, abc, bс?, ..., а"bс, bc", ... }