Which of the following statements describe how constraint propagation helps in solving CSPs? It can update the domains of unassigned variables as soon as a value is chosen for one variable. It reduces the number of possible values for variables based on known constraints. It only works after all variables have been assigned. It can eliminate entire branches of the search tree before any values are assigned. It replaces the need for any form of search in solving CSPs.