Construct a Turing machine for L = {aibjck | i < j < k or i > j > k}

Prerequisite – Turing Machine
The language L = {aibjck | i < j < k or i > j > k} is same as the union of two languages L1={aibjck | i < j < k } and L2={aibjck | i > j > k }
In this language, every string of ‘a’, ‘b’ and ‘c’ have certain number of a’s, then certain number of b’s and then certain number of c’s.