A new algorithm is developed to solve zero-one multiple objective problems in linear programming. Ten problems were selected at random and solved twice, once using the current algorithm and once using the newly developed one. The results (CPU time in micro-seconds) are as follows: Problem Current New

1 8.05 8.71
2 24.75 24.74
3 28.33 28.74
4 8.45 8.77
5 9.19 8.80
6 25.20 24.83
7 14.05 14.82
8 20.33 20.77
9 4.82 4.71
10 8.54 8.72

From the 99% confidence level, what would you conclude?