Which of the following techniques for solving constraint satisfaction problems (CSPs) can always determine every solution to the CSP whenever there is at least one solution. 1) Arc Consistency with Domain Splitting 2) Stochastic Beam Search 3) Stochastic Local Search 4) Genetic Algorithms

Note: There may be more than one answer