A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem