Using adders, subtracters, comparers, copiers, or multipliers, draw block diagrams for Turing machines that compute the function f(n) = 2n for all positive integers n.