all work in the space given, where pomsade, place a box aruund yo A Turing machine M is defined by the sextuple (Q..8, q,"".gen-, F), where taal saw" Q, is a finite set of states, S, called the alphabet, is a finite set of symbols thal can be stored on the tape , called blank, is the initial content of each cell, . called the trunsition function, is the "program" or the set of instructions for the costrol wnit Gunit E Q, is the initial state of the machine, *Cerror Q. is the error state Q, is the set of final states. 1. Consider a Turing Machine as a language accepter. Using the alphabet = a, b.,I will begin to design a TM that accepts all words w E {a,b)" such that w ends with anaThe TM must be able to read in a finite word and determine if its last symbol is an 'a'. To distinguish the end of a word we will assume that words end with the tape symbol blank O. The machine, starting in its initial state, reads a word, on its tape, and moves Right each time it encounters either ia' or 'b'. For this purpose the TM keeps its initial state. However, when a is encountered this calls for a change in the state to record the end of a word. While in this new state, the tape head moves back one cell to the left and checks for an 'a'. If the last symbol is 'a' the machine goes into its final state and halts. Otherwise the TM goes into an error state and the word is not accepted as part of the language. Write the transition functions that describe this machine. Also state the tape alphabet, the set of states, Q, and the set of final states F