Step 1: Write the word: E F F E C T Step 2: Look for matching alphabetical distances.
Alphabetical positions:
E(5), F(6), F(6), E(5), C(3), T(20)
Valid pairs:
E(1) to F(2) → distance 1, alphabetical gap = 1
C(5) to E(2) → distance 2, alphabetical gap = 2 So, total valid pairs = 2