Draw the transition table, derived from a Turing machine which recognizes the language

$L$ which accepts a binary string containing equal number of $0s$ and $1s.$ Also, design the

Turing machine for this language.

Design a TM for the language which accepts binary strings $($w$),$ where $w$ is an odd palindrome.

Design a TM which accepts a binary string $101$ and replaces it with $110.$

Please show step by step