Consider a restricted variant of Turing machine, called Turing$*$ machine, defined as follows. Just like a Turing machine, a Turing$*$ machine is a Turing Machine $($Q$,\backslash$Sigma $,\backslash$Gamma $,$ q$\_0,$ q$\_$accept $,$ q$\_$reject $),$ where $\backslash$delta satisfies a special condition:

$\backslash$delta $($q$,$ a$)$ in Q $\backslash$times $\backslash$Gamma $\backslash$times $\{$R$\}$ for all $($q$,$ a$)$ in Q $\backslash$times $\backslash$Gamma $.$

Prove the following: if there exists a language L such that there is a Turing$*$ machine that decides L$,$ then there exists an NFA that recognizes L$.$