Are the following statements true or false? 

a. Running forward checking after the assignment of a variable in backtracking search will ensure that every variable is arc consistent with every other variable. 

b. In a CSP constraint graph, a link (edge) between any two variables implies that those two variables may not take on the same values. 

c. For any particular CSP constraint graph, there exists exactly one minimal cutset. 

d. Two different CSP search algorithms may give different results on the same constraint satisfaction problem. 

e. A CSP can only have unary and binary constraints. 

f. If forward checking eliminates an inconsistent value, enforcing arc consistency would eliminate it as well. 

g. If enforcing arc consistency eliminates an inconsistent value, forward checking would eliminate it as well. 

h. When enforcing arc consistency in a CSP, the set of values which remain when the algorithm terminates depends on the order in which arcs are processed from the queue.