Draw a Turing machine that decides the language of all words over the alphabet {a, b} that have an odd number of a’s and an odd number of b’s
Yes. "Words over the alphabet $\Sigma=\{a,b\}$" means that the input can be any string containing $a$s and $b$s in any order, and "decide" means that the machine must halt (accept or reject) on every input, and not get into an infinite loop.