Recall that the K-SAT problem takes as input a boolean formu…

Recаll thаt the K-SAT prоblem tаkes as input a bооlean formula in conjunctive normal form such that each clause has at most K literals, and outputs a true assignment, or report when such assignment does not exist. Head TA Emily claims the following: "It is known that for every pair of integers a,b>1, there is a reduction from a-SAT to b-SAT".