Your reduction will need to clearly explain how given any instance ?G, k? for the CLIQUE language you construct an instance ?G? , k? ? for the STRANGERS language. For full credit, make sure that you formally show every one of the parts needed for the NP-completeness proof.