Consider the following two regular expressions:

$($a$)(1|)$

$($b$)1**(110{)}^{**}0+$

Let the language defined by the first regular expression be A and the language defined by the second be B$.$

For each of the following, find a string that satisfies the stated requirements:

Consists of only $0\text{'}$s and $1\text{'}$s but is in neither A nor B$.$

$1.\mathrm{.}1$ starts with $1,$ doesn't end with $0$

$1...0$ starts with $1,$ ends with $0$

$0\mathrm{.}1$ doesn't start with $1,$ doesn't end with $0$

$0$dots$\mathrm{.}0$ doesn't start with $1,$ ends with $0$