Define a Turing Machine M that computes the function f: {a, b}* → N, where:
f(x) = the unary encoding of max(#a(x), #b(x)).
For example, on input aaaabb, M should output 1111. M may use more than one tape. It is not necessary to write the exact transition function for M. Describe it in clear English.