Here are three data lists:

10, 20, 30, 40 , 50, 60, 70;

70, 60, 50, 40, 30, 20, 10;

20, 40, 30, 60, 10, 70, 50;

If we use insertion sort to respectively sort these three date lists in an ascending order, which date list needs the most number of comparisons or have the most computation time, which data list needs the least number of comparisons or have the least computation time?