Consider the following puzzle. You are to pick out 4 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 that the word’s third letter appears 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 letter of each word chosen must be at least as large as the sum of the positions in the alphabet for the second letter of each word chosen. Formulate an IP to solve this problem.