$3\mathrm{.}5.$ In each case below, give a simple description of the smallest set of

languages that contains all the "basic" languages $\frac{O}{,}\{\},$ and $\{\}($for

every $in$ and is closed under the specified operations.

a$.$ union

b$.$ concatenation

c$.$ union and concatenation