Design a Turing machine to solve the following problem: It should be checked whether a sequence of digits consisting of the digits $0,1,$ and $2$ is sorted in ascending order or not. For sequences such as $012,0001111122,222,$ or $000022,$ the symbol $\text{'}$s$\text{'}$ should be appended for "sorted". For sequences such as $21$ or $0011212,$ the symbol $\text{'}$U$\text{'}$ should be appended for "unsorted". Provide the set of states Z$,$ the initial state, the input alphabet L$,$ the tape alphabet $,$ and the transition table. Initially, the read$-$write head should be positioned before the first symbol, and at the end, it should be on the symbol S or U$.$ Comment on Each stage or transition

$($Photo is only an example of another example$)$