Consider the following languages:

EONETM$=\{$M$$M$$is$$a$$TM$$and$$M$$accepts$$exactly$$one$$string$$that$$starts$$with$1\}$

SONETM$=\{$M$$M$$is$$a$$TM$$and$$M$$accepts$$exactly$$some$$strings$$that$$starts$$with$1\}$

AONETM$=\{$M$$M$$is$$a$$TM$$and$$M$$accepts$$exactly$$all$$strings$$that$$starts$$with$1\}$

Note that some can mean at least one or all. According to mapping reducibility, a reduction F from a language A to a language B is a TM F stasfying w in A$$F$($w$)$ in B Answer the following questions: