true or false give a short explanation (please only answer the english part of the question)

vii. If we want to prove that a search problem X is NP-complete, it's enough to reduce SAT to X. Bir X arama probleminin NP-tam olduunu kantlamak istiyorsak, SAT" Xe drmek yeterlidir