Does the question mean draw a Turing machine that takes input with any number of a's and any number of b's (eg. aaabbb, ab, abababab, etc.). The turing machine should only then accept or reject the input and should not be stuck in loop?
A decider is a TM that halts (i.e either accepts or rejects) on any input.
The TM that is requested should accept any input that has an odd number of $a$s and an odd number of $b$s, and should reject all other input.
The TM you have depicted does not meet the requirements (HINT: consider the string $aa$).