Use the construction in the proof of Theorem $1\mathrm{.}45$ to give the state diagrams of

NFAs recognizing the union of the languages described in

a$.$ Exercises $1\mathrm{.}6$a and $1\mathrm{.}6$b$.$

b$.$ Exercises $1\mathrm{.}6$c and $1\mathrm{.}6$f