Define the tower function T N-N by the recursion T(0)-1, Thus T(n) is a tower" of n 2's. Prove that there are infinitely many strings extremely compressible in the sense that E 0,1)* that are 'I'(C(x))