Can you solve this for me

1. Count, using the three step procedure outlined after this sentence, the number of permutations of the word ANTIESTABLISHMENT in which no two consecutive positions in the permutation can contain the same letter of the alphabet. Step 1: For each repeated letter , let A, be the number of permutations that contain r in two consecutive positions. Step 2: Using the principle of inclusion-exclusion, count the words in the union of sets. Step 3: Now that you have accounted for all the undesired permutations, you should be able to count the number of desired permutations