Recall the classic bridge crossing puzzle. Let the crossing times of the four people be represented by A, B, C, and D with 0<A<B<C<D. If the speeds of the four people are distinct random values when is the trivial solution (A escorts everyone else across) faster than the solution required in the classic puzzle?