What does the Min$-$Conflict Heuristic aim to achieve in CSPs$?$

Select one:

It seeks to select values for variables that minimize the number of violations with constraints involving the variable.

It aims to minimize the computational overhead by reducing the number of variables considered at each step.

It ensures that each variable's value has the maximum possible support among the remaining unassigned variables.

It tries to maximize the constraints satisfied at each step of the assignment process.

To enforce global constraints across all variables to ensure overall solution feasibility.