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

Prerequisite – Turing Machine
The language L = {aibjck | i < j < k or i > j > k} ∩ {aibjck | i > j > k or i > j > k} is same as the languages L={aibjck | j > max(i, 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.