Develop a One$-$Tape Linear Bound Automata that accepts the language with an odd number of characters with $|$w$|1$ Any string in L must end with an $$a$.$ If the string is accepted, empty the tape except for a single $1$ in the leftmost position. If not accepted empty the tape except for a single $0$ in the leftmost position. The read head begins on the first character of w$.$

Let $=\{$a$,$ b$,$ c$\}.$

Let G $=\{$a$,$ b$,$ c$,1,0,,],[,$ and any additional desired symbols$\}.$