Hi everyone, pls help me with the next problem:

Design a Turing machine that counts the number of times a symbol replaces another in a Turing machine encoding (the count can be with marks such as |, |=1, ||=2, |||=3, etc).

1. Identify the language accepted by the Turing machine.

2. Identify a string accepted by the Turing machine.

3. Identify a string rejected by the Turing machine.

4. Design the Turing Machine