(a) Let's say that a polynomial-time reduction R from language A to language B is a shrinky-dink reduction if it has the following property: for every x, the output R(x) of reduction R on input x is a string of length R(x)O(logx). Show that if there is a polynomial-time shrinky-dink reduction from CLIQUE to L where L is a language in NP, then NP k1TIME(n(logn)k). (The latter complexity class is sometimes referred to as "quasipolynomial time.")