Explain the term Intractability. Is SAT problem is intractable? Justify

Definition: Intractability is a concept in computational complexity theory that classifies problems based on the time and space resources required to solve them. - Problems that can be solved within reasonable time and space constraints (i.e., in polynomial time) are called tractable problems. - ...