Construct the transition function, $,$ of Turing machines, M $=($Q$,,,$ $,$ s$0,$ qa$,$ qr$),$ that accept the

following languages:

a$)$ L$($M $)=\{$ $|$ in $\{$a$,$ b$\}$ contains the symbols a twice as many times as the symbol b $\}$

b$)$ L$($M $)=\{$ $|$ in $\{$a$,$ b$\}$ $=(($a$)($ba$))\}$