Build a TM that accepts the language ODDPALINDROME. Submit at least four traces, along with your TMs, that meet the following criteria. Trace two strings that are accepted, demonstrating two different scenarios. Trace two strings that are rejected, demonstrating two different rejection scenarios. You must explain why your strings are accepted and why they are rejected. You must also explain how each state operates.