Consider the following Constraint Satisfaction Problem (Artificial Intelligence).

W, X, Y and Z are variables with their domain of values as given below:

W = {1, 2, 3}

X = {1,2,3,4}

Y = {1,2,3}

Z = {1,2}

The constraints are:

WX = {(1,1), (2,2), (3,3)}

WZ = {(1,2), (2,1), (3,1)}

XY = {(1,3), (2,1), (4,1), (4,2)}

ZY= {(1,1), (1,3), (2,2)}

Illustrate how the following search techniques will proceed to find a solution for the CSP?

a) backtracking search, b) backtracking search with forward checking, and c) arc consistency with forward checking