Use the pumping lemma to show it is not context free. Then, construct a Turing machine which accepts the language. (And briefly explain how the construction works.) {a^i b^j c^k | i > j > k}