Please Include a screenshot

Using JFLAP: Consider the computational problem Add5Decimal: Add5Decimal Input: a string representing a number in base-10 Output: a string representing + 5 in base-10

Create a deterministic single-tape Turing machine in JFLAP that solves Add5Decimal. The input number can be arbitrarily large, but you can assume the input is correctly formatted and contains at least one digit. Example test cases: Input (Read/write head starts at first character) | Output (Make sure theres nothing else on the tape after) 2 7 8 13 23 28 99 104 10019 10024 99999 100004