Give the state diagram of a Turing machine that accepts the following language over = {0,1}:

1. {0^m1ⁿ: m > n ? 0}

2. {w : w contains the same number of 0s as 1s}