[20 points] (a) [10 points] Draw a state diagram for a Turing machine to preform max function that is finding a maximum number from a sequence. The tape is organized as the input sequence of numbers follow by the output _max number. There are 3 possible symbols, i.e. Z = {0,1,2}. *** Note: there are 3 possible symbols, 0, 1, 2 in the input sequence.

e.g. Input 01211, where read-write head is on leftmost 0. Output 01211_2, where the rightmost 2 is the outputted max number. (When the input sequence is 1100, then the output will be 1100_1, where the rightmost 1 is the max number in the input sequence.) (Note: keep the input sequence the same as given.)

(Part B question 2 py file will be followed this state diagram. That is your part B question 2 py file needs to code your state diagram.)

TM digrams