Design Turing machines that accept the following languages. For each language, rst give a brief description in English of your strategy, then give the transition diagram of the Turing machine.

(a) {w₁cw₂ w₁,w₂ {a,b}^*,w₁ is a substring of w₂}

(b) {aⁱb^jc^k : i j, j k, i k}