Before revision:  (iii) A lower bound for the run time of the   on long k-paths  .
After revision:  (iii) A lower bound for the run time of the  on long k-paths . We also prove a tighter lower bound for the run time of the (1+1) EA on jump functions by showing that, regardless of the jump size, only with probability O(2^{-n .