Design a Turing machine that recognizes the language L = {a^i b^j c^k d`| if i = 1 then j = k = `}.

Give a transition diagram and a formal description (where should be given as a table with

blank entries where it is undefined (i.e. the machine dies)).