help on turning machines. will need to use a simulator online if possible (https://alistat.eu/online/turingmachinesimulator):

Design a Turing Machine that takes strings made of fa, b, c) and removes all c's that are in between a's. For example, given "abcaca", the result should be "abcaa". Given "bbaccab", the result should be "bbaccab". Given "acaca", the result should be "aaa". Note a FSM is not capable of transforming strings in this way. State Sets: Input Alphabet: Transition Function (You may not need all of the cells): Simulation Code: Screenshot of Passing Test: Design a Turing Machine that takes strings made of fa, b, c) and removes all c's that are in between a's. For example, given "abcaca", the result should be "abcaa". Given "bbaccab", the result should be "bbaccab". Given "acaca", the result should be "aaa". Note a FSM is not capable of transforming strings in this way. State Sets: Input Alphabet: Transition Function (You may not need all of the cells): Simulation Code: Screenshot of Passing Test