$8$

Problem $6($Different $=$ awesome$).$ Are strings different? That is$,$ our goal is to design a Turing Machine that accepts strings that are different.

a$.$ Describe how a Turing machine, Different, would accept the string $1011$#$10101.$ Give a rough idea what your machine will do $($you will design a state diagram below$).$

$\backslash$table$[[,,1,0,1,,$#$,1,,1,,,,],[,,1,0,,,,,,1,,1,$U$,],[,,1,0,,1,,,,,,,,$:$.$