<s>[INST] A computer science student at Harvard University designed an experiment to compare the running times of two sorting algorithms, mergesort and heapsort. The student wants to determine whether mergesort (on average) runs longer or shorter than heapsort. To answer this question, the student randomly selects 500 sorting algorithms, runs them on the same 1000 data sets, and records their execution times. If the data show that / mergesort on average runs longer than heapsort, can the student claim (with statistical significance) that mergesort (on average) runs longer than heapsort?[/INST]