Give a Boolean formula that is satisfiable exactly when the graph below can be colored with three colors so that no two connected nodes have the same color. Use the variables ai, bi, ci (i ∈...

Give a Boolean formula that is satisfiable exactly when the graph below can be colored with three colors so that no two connected nodes have the same color.

Use the variables ai, bi, ci (i ∈ {1,2,3,4,5}) to represent a nodes' color. The variable ai holds when the node i has color "a". bi or ci for colors b and c.

Each node must have exactly one color.

Extracted text: 2 3 4 5