Problem
Give a formal Turing Machine that sorts a bunch of1 s,2 s, and3 swhen given a string of them in any order. Example input: 223123213231211221333131 output: 111111112222222233333333. This should be done with the tape alphabet being only the input alphabet and the blank symbol.