Construct a Turing machine with input alphabet $\{a,b\}$ to accept each of the following languages by final state.

b$)\{a^i{b}^j{a}^i{b}^j|i,j>0\}$

c$)$ Strings with the same number of $a\text{'}$s and $b\text{'}$s