DP={ languages L : there is a language L1NP and a language L2 coNP such that L=L1L2.} (b) Here is a fact which can be shown (you don't need to show this): Fact: There is a polynomialtime reduction (call the reduction R ) from SAT to CLIQUE which has the following property: if the input formula for SAT is satisfiable then the pair (G,k) constructed by R has largest clique of size exactly k, and if the input formula is not satisfiable then the pair (G,k) constructed by R has largest clique of size exactly k1. Recall that the LARGEST-CLIQUE language is the set of all pairs (G,k) such that G is an undirected graph and the largest clique in G is of size exactly k. Show that LARGEST-CLIQUE is DP-complete. (Hint: Use the fact stated above.)