Q$1(5$ points$)$

Design a diagram for a Turing machine to accept strings with $a,b,$ and c$\text{'}$s where the

number of a$\text{'}$s is equal to the number of b$\text{'}$s minus the number of c$\text{'}$s$.$ The a$\text{'}$s$,$ b$\text{'}$s and

c$\text{'}$s could occur anywhere in the string. It must be deterministic and has accept and

reject states?

$1-$Write the outline for the Turing machine $($informally how you think it can be solved$)$

$2-$ Design the diagram $3-$ Trace the string babacb Design a diagram for a Turing machine to accept strings with a$,$ b$,$ and c$\text{'}$s where the number of a$\text{'}$s is equal to the number of b$\text{'}$s minus the number of c$\text{'}$s$.$ The a$\text{'}$s$,$ b$\text{'}$s and c$\text{'}$s could occur anywhere in the string. It must be deterministic and has accept and reject states?

$1-$Write the outline for the Turing machine $($informally how you think it can be solved$)2-$ Design the diagram $3-$ Trace the string babacb