Let A $\backslash$Sigma $*$ be a language, and let M be a Turing machine such that, for all strings x in $\backslash$Sigma $*,$ if x in A then M accepts x$,$ and if x $$ A$,$ then M rejects x$.$

Mark all that are guaranteed to be true $($i$.$e$.,$ mark all that hold for any choice of A and M satisfying the conditions above$)$:

Group of answer choices

M recognizes A$.$

M decides A$.$

M does not decide A$.$

L$($M$)=$ A$.$