In a CSP (Constraint Satisfaction Problem), consider a map coloring example for a part of the USA. Here are the constraints. No two neighboring states can have the same color. The only colors available are red, blue, yellow, green, orange, purple, black and white. You are not allowed to mix colors (e.g. you cannot make grey using black \& white). We have the following information on neighboring states for a part of the map.
TX is bordered by NM, OK, AR, LA
NM is bordered by TX, AZ, CO, OK
OK is bordered by TX, AR, NM, CO, KS
LA is bordered by TX, AR, MS
Which of the following is NOT acceptable in a valid (partial) solution of this CSP?
a. TX =purple, NM= orange, OK =green, AR =black, LA = white
b. TX= white, NM= blue, OK, green, AR= purple, LA= brown
c. TX = blue, NM = red, OK = green, AR = yellow, LA = white
d. TX= red, NM= blue. OK= yellow, AR= black, LA = white