02-) 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 l's 1: If the number of 1's the number of O's N: If the number of l's-the number of 0's Assume null string has an equal number of 0's and 1's. Use the following format for your instructions (5-tuple): Direction) Tuple entry Meaning Blank character, 0 Wildcard in or , means "no change". Move head left Move head right The "starting" state 40 HALT The "halting" state