7. (Weber, 1990) You have the following three-letter words: AFr, FAR,TVA, ADV, JOE, FIN, OSF, and KEN. Suppose that we assign numeric values to the alphabet starting with A = 1 and ending with Z :; 26. Each word is scored by adding numeric codes of its three letters. For example,AFT has a score of 1 + 6 + 20 = 27. You are to select five of the given eight words that yield the maximum total score. Simultaneously, the selected five words must satisfy the following conditions:

(

sum of letter 1) < (sum of letter 2) < (sum of letter 3)

scores scores scores Formulate the problem as an ILp, and find the optimum solution.