Problem $5$ Let M be the following Turing Machine M

$\{$This problem is related to Example D in the slides from Chap $9\mathrm{.}1$ Part $1]$

a$.$ Do a configuration trace for the Turing Machine M to show that $w=$ aabab is accepted by M$.$ You must use the correct configuration pattern for Turing Machines.

b$.$ Does your configuration trace prove that M accepts w $=$ aabab? Justify your answer.

c$.$ Use JFLAP to create and test a Turing Machine M$1$ that accepts

$L=\{\begin{array}{ccc}\text{w}\text{i}\text{n}& \{a,& b{\}}^{**}\text{:}w\end{array}$ has at least $2$ bs$\}$

In the answer for chegg must include the JFLAP diagram with test cases for the final asnwer.