For the following languages, give a simple one-sentence description and show two strings that are in the language and two that are not (unless there are fewer than two, in which case show as many as possible). For each Σ = {a, b} a= ℒ {w I exactly one prefix of w ends with a b}
b= â„’ {w I exactly one suffix of w begins with a b}
c= â„’ {w I exactly one prefix of w begins with a b}
d= â„’ {w I exactly one suffix of w ends with a b}
e= â„’ {w I all suffixes of w begin with a b}
f= ℒ {w | Ǝμ∈Σ+(w = aua)}
g= ℒ {w I Ǝμ∈Σ* (w= u^3)}