4 Since a Turing machine can write symbols on its tape, it gives a Turing machine an ability to produce an output on its tape. Give a state diagram of a Turing machine that process the input o" where n > 0 and produce the output 0"1" on its tape. Note that your machine should reject if the input is not 0" for n > 0. Also assume that the set of tape alphabets o,1,,x. (10 points)