Assume you have the following two languages over the

alphabet $\{$a$,$b$\}$

L$1=\{$w$|$w is a string of length $3\}$

L$2=\{$w$|$w is a string that contains only b$$s$\}$

c$.$ Construct and provide the formal definition with transition table of a NFA that

recognizes L$1$ U L$2($union operation$)$

d$.$ Construct and provide the formal definition with transition table of a NFA that

recognizes L$2$ L$1($concatenation operation$)$

e$.$ Construct and provide the formal definition with transition table of a NFA that

recognizes L$1*($star$/$Kleene operation$)$