Note: Turing Machine must be creating in JFLAP software. The tutorial link of JFLAP has already been sent via course announcement. The snapshots of Turing machine diagram and testing accepting/rejecting strings must be pasted in assignment

Part 2.) Design a Turing machine in the following three ways of descriptions that decide the language L = {12 + exponential function. : n 203, the language consisting of all strings of Os in given The Formal description of Turing machine 2. Implementation level description of the Turing machine 3 High level description of the Turing machine Some example words of the language are as follows: adl. Part 2.) Design a Turing machine in the following three ways of descriptions that decide the language L = {12 + exponential function. : n 203, the language consisting of all strings of Os in given The Formal description of Turing machine 2. Implementation level description of the Turing machine 3 High level description of the Turing machine Some example words of the language are as follows: adl