Match the regular expression with the language description.

$($Just use a plain $*$ for Kleene star; don't use a superscript.$)$

Strings of zeroes and ones that contain a single one.

$0*10*$

Strings of zeroes and ones that contain the substring $001.$

$(0+1)*001(0+1)*$

Strings of a$\text{'}$s and b$\text{'}$s that contain exactly two a$\text{'}$s$.$

a$*($ba$*$b$)*$a$*$a

Strings of a$\text{'}$s and b$\text{'}$s that have one or two a$\text{'}$s$.$

b$*$ab$*$ab$*$

Strings of a$\text{'}$s and b$\text{'}$s with an even number of b$\text{'}$s and that also end with at least one a$.$

b$*$ab$*+$ b$*$ab$*$ab$*$