please use Jflap solutions.

Problem 1 Generate a single tape Turing machine over the alphabet [a, b, c, x, y, z] such that the input is received in three distinct sections: Input of (a+x)" where the number of 'a input characters is odd, every time two a, characters are found they are replaced with x's Followed by b(atbtx) where the number of 'b' input characters is odd, every time two 'b' characters are found they are replaced with y's, all a's and all x's are replaced with y Followed by c(atbtctxty)* where the number of c' input characters is odd, evervtime two c' characters are found they are replaced with 'z' characters, all a's, b's, x's and y's are replaced with z's. Thus if the input string is: axxaxxaxxbaxbaxbcabxycabxycxy Then the output string is: xxxxxxaxxyyyyyybzzzzzzzzzzczz