You will be scored on: Mathematical correctness - whether your state diagram works Accuracy, clarity, and depth of explanations Neatness and organization of ideas Instructions: Briefly describe the algorithm in bullet points or sentences. Then design a Turing Machine state diagram which implements that algorithm. Question 1 Design a state diagram for a Turing Machine that accepts all strings on the binary alphabet and flips every digit in the input (i.e. 0's become 1's and 1's become 0's). For example, if the input is 1011, the machine would flip each digit before moving to the accept state. The ending tape would read 0100 when the machine gets to the accept state.