Suppose we have the variables, O, N, E, T, W, that range over the natural numbers. Choose natural numbers for each variable such that the following sum holds:

5. (3 pt.) A constraint satisfaction problem is some problem with a set of constraints - a constraint is a propositional formula - and when a possible solution meets these constraints we consider it valid These types of problems are used a lot in cryptography The problem. Suppose we have the variables, O,N, E,T, W, that range over the natural numbers. Choose natural numbers for each variable such that the following sum holds: ONE T W O where the following constraints hold: i. The numbers assigned to each variable must be distinct ii. O3,5<10>