Q$1.$

Consider the following language:

$$ L$=\{$ a$^$n b$^$m c$^(2$m$+1)|$ n$,$m$>=0\}$

Design a Turing Machine that decided whether a given input string belongs to this language.

According to the given funtion for a positive integer x$,$ design a Turing Machine to compute the function. $($x is in binary format$)$