Design a Turing Machine with

Question

One infinitely long tape containing 0, 1, or blank The minimal number of states in its transition An input number written on the tape initially
that computes the function of
f(n)=n×4
for any natural number n.

You are expected to submit
A definition of the encoding of numbers with a brief justification
The transition table/diagram for the Turing Machine
A sample input/output of your function on the tape