what's the Turing machine code for w $($ w $=\{$a$,$ b$\}+)$ that accepts when the number of a$\text{'}$s in w are the same as the number of b$\text{'}$s in w and number of a$\text{'}$s in any prefix v of w is same or larger than the number of b$\text{'}$s in v$?$