(a) Design a Turing Machine that recognises a binary string in which the number of zeros and ones is the same, i.e. will accept strings 00110011, 010110, 111000 but will reject 011, 100, 000001. Write down the strategy for solving this problem and draw the transition diagram in your answer. 5 mark(s) (b) Add to your answer to part (a) so that the Turing Machine accepts only strings of a form 0"1", where n is arbitrary. 2 mark(s)