Most constraint programming operate only on CSPs with binary constraints. In this problem, you will attempt to convert any CSP into one with only binary constraints. 1. Show how a single ternary constraint such as "A + B = C" can be turned into three binary constraints by using an auxiliary variable. You may assume finite domains. Hint: Consider a new variable that takes on new values that are pairs of other values, and consider constraints such as "X is the first element of the pair Y ."