Match the following $$NFAs$$ with the regular expressions they correspond to

Which of the following languages is regular?

Consider the following finite state automation

The minimum state automation equivalent to the above $$FSA$$ has the following number of states

A minimum state deterministic finite automation accepting the language $$L = \left\{ {w\left| {w \in } \right.\,\,{{\left\{ {0,1} \right\}}^ * },\,\,} \right.$$ number of $$0'$$s and $$1'$$s in $$w$$ are divisible by $$3$$ and $$5$$, respectively$$\left. \, \right\}$$ has