$[5$ pts$]$ Given an alphabet, $=\{x,y,z\},$ list all strings of length $2$ to $4$

in the language $L=x{y}^{**}z$

Length $2,xY,xz$

Leigth $3,xyy,xyz$

length $4x$ yyz

$[5$ pts$]$ Let the alphabet $=\{a,b\}.$ Given the regular expression $r=(a+b{)}^{**}bb,$ 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.

$[5$ pts$]$ Design and draw the state transition diagram of a finite automaton $($FA$)$ for the regular

language above, in question $2$