Step 1: Collect the forbidden pairings.
The rules forbid these pairs together: $(a,c)$, $(c,e)$, $(d,g)$, and $(d,f)$.
Step 2: Decide the strategy.
We only need to find the one option that breaks at least one forbidden pair. Scan each team for a banned duo.
Step 3: Test option A, a b d e h.
No $c$, so $(a,c)$ and $(c,e)$ are safe; $d$ appears without $g$ or $f$, so $(d,g)$ and $(d,f)$ are safe. Valid.
Step 4: Test options B and C.
Option B (a b f g h) has no $c$ and no $d$, so all rules hold. Option C (a b e g h) has no $c$ and no $d$, so all rules hold. Both valid.
Step 5: Test option D, a b d g h.
Here $d$ and $g$ sit together, which directly violates the rule that $d$ and $g$ cannot both be sent.
Step 6: Conclude.
Option D is the impossible working unit.
\[ \boxed{a \rightarrow b \rightarrow d \rightarrow g \rightarrow h} \]