No calculators are allowed. Show your work. The points for each problem are indicated. Problems with

incomplete work may receive partial, or no credit.

COs: $[$No direct COs$]$

Points:

$\frac{?}{20}$

$[5$ pts$]$ Let the alphabet $=\{a,b,c\}.$ Given the regular expression $r=b(a+c)*b,$ assume $a$

language $L(r)$ is the language defined by the regular expression $r.$ Explain in English what

accepted strings in the language are like.

I will need you to slove it on a pice of paper. please show all your work. also no need to explain anything just slove it like a student would