Part 2.) Design a Turing machine in the following three ways of descriptions that decide the language L-(i:n 20), the language consisting of all strings of 0s in given exponential function. 2n+1 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: a. b. 1 lo. Part 2.) Design a Turing machine in the following three ways of descriptions that decide the language L-(i:n 20), the language consisting of all strings of 0s in given exponential function. 2n+1 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: a. b. 1 lo