Turing Machine in C++ using TM concept (switch cases)

TM HAS TO BE IMPLEMENTED IN TM CONCEPT MEANING USING NESTED SWITCH.
Input #w# : w is in {a,b}*,

M computes na(w) –nb(w) in unary notation.

Assume that na(w) > nb(w).

For example: input #bbabaababaaaa#

Will yield: #bbabaababaaaa#III#