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)}

Print "censored" if userinput contains the word "darn", else print userinput. end with newline. ex: if userinput is "that darn cat.", then output is: censoredex: if userinput is "dang, that was scary! ", then output is: dang, that was scary! note: if the submitted code has an out-of-range access, the system will stop running the code after a few seconds, and report "program end never reached." the system doesn't print the test case that caused the reported message.#include #include using namespace std; int main() {string userinput; getline(cin, userinput); int ispresent = userinput.find("darn"); if (ispresent > 0){cout < < "censored" < < endl; /* your solution goes here */return 0; }