A$-$ Write regular expression that generate the following languages over the alphabet $\{0,1\}$

All strings that contains exactly three $0\text{'}$S in total.

All string of even length over.

All string that ending in $011.$

All string the nonempty binary string

B$-$ Construct NFA for the language of the regular expression $(b|).$