Write a Turing Machine program(draw states) to sort a nonempty string of A's and B. Assume the tape head starts on the leftmost character. For example if the tape contains BAABABB to start with, then when the machine halts AAABBBB will be left on the tape. Machine will be in the halt state (H) when done with tape head on the first nonblank character.