Build$/$design a Turing machine $($TM$)$ that determines whether a given word contains at least one instance of the substring aab. If it does, then the TM should write a T on the tape after the input word.