Consider a constraint  graph: Linear connections between nod…

Consider a constraint  graph: Linear connections between nodes are in this sequence, V1-V2-V3-V4-V5, and each of these nodes is connected to a sixth node V0.  Respective domains are as follows: V0={1}, V3={1,2,3},   all other nodes ={1,3} Constraints: No adjacent nodes may have the same value. Which one below is a solution?