Design a Turing machine on the input alphabet {x,y,z} that removes all z characters from the input such there are no gaps. If the input string is xzzyxzy, the output should be xyxy.

Hint: The final string does not need to reside on the same part of the tape where it started

Must include a diagram representation