Given a string form the language L((0+1)*) on the tape, give the program and draw the state diagram of a Turing machine that can output on the tape

Q2-) Given a string from the language L((0+1) ) on the tape, give the program and draw the state diagram of a Turing Machine that can output on the tape 0: If the number of 0's > the number of 1's 1 If the number of 1's > the number of 0's . N: If the number of 1'sthe number of 0's Assume null string has an equal number of O's and 1's. Use the following format for your instructions (5-tuple) (

) Tuple entry Meani nsg Blank character. Wildcard in or to match any character or state For

, , means "no change" Move head left Move head right The "starting" state HALT The "halting" state Examples 1. (0 0 XR qo): If in state go. the symbol on the tape is 0, change it to X and move the head to right and stay on the same state 2. (11_R q2): If in state qi, the symbol on the tape is 1, erase it and move the head to riglt and change to state q2 . 3. (93 *0 HALT): If in state q3, the symbol on the tape is not important, just change it to 0 and HALT