Using Automata (Computer Science) knowledege solve one question using the method in the example solution, please look at the example solution before solving the question because my professor wants things done a certain way and that way only.

Question you have to solve is very similar to the example problem so look at the example problem and its solution. Do not use diagrams at all my professor doesn't accept that answer hence why I am providing a sample solution.

------------------------------------------------------------------------------------------------------------------

Question 1) Construct a pda P for the following language L={0^4i 1^i | i greater or equal to 0}

-------------------------------------------------------------------------------------------------------------------

Example Solution to the problem: Construct a pda P for the following language L={0^i 1^4i | i greater or equal to 0}

a pda P for the following language: ?= { 04111 l i>1 } where L = Lr(P) (acceptance by final state). State on which side you write the top of the stack, left:- 1 or right- Hint: Remove four markers on the stack for every