Consider the following puzzle. You are to select four three-letter “words” from the following list: DBA DEG ADI FFD GHI BCD FDF BAI. For each word, you earn a score equal to the position of the word’s...

Consider the following puzzle. You are to select four three-letter “words” from the following list: DBA DEG ADI FFD GHI BCD FDF BAI. For each word, you earn a score equal to the position of the word’s 338 Chapter 6 Optimization Models with Integer Variables third letter in the alphabet. For example, DBA earns a score of 1, DEG earns a score of 7, and so on. Your goal is to choose the four words that maximize your total score, subject to the following constraint: The sum of the positions in the alphabet for the first letters of the four words chosen must be at least as large as the sum of the positions in the alphabet for the second letters of the words chosen. Use Solver to solve this problem.