Solve the 19th question. Construct a Turing Machine for the following function and show an accepting sequence of configurations using an example string

230 Turing Macin 10.12 Exercises 19. Implement a simple tokenizer: given a string with single blank spaces separating other 25. The Tu count the number of tokens in the string and output this number in unary. For exal Bver ab be abe bea abc a be the output shall be 20. Interleave two strings. Given two strings of equal length (separated by a single blank cell, uh a, b,b b...b the machine halts after writing on the tape an interleaved string composed of the first elemen of the two strings, followed by the second elements of the two strings, and so on, ending wih the last elements of the two strings, in that order: ababab,..a,b B. Make changes to the given Turing machine. Modify the Turing mhiu