Please help with the python algorithm. Thank you.

design a program combining both insertion sort and quicksort algorithms to find out the most optimal K minimizing time efficiency of your algorithms using 10000 data file. You may use your time efficiency program. Please collect and display some performance data which proves your k is the most optimal shown in below

this is just sample,

K-10: 11.42 seconds

K-5: 11.07 seconds

K-: 10.55 seconds

K +5: 10.59 seconds.

Please note that the efficiency data displayed above are fictitious ones made up for demo purposes only. They are not actual simulation results

data.txt

348548 141913 489224 81717 403131

143034 876953 784947 593480 355401

200777 855598 470624 438334 967124

314937 673395 78981 748181 738558

160619 305980 330514 143635 269516

443338 897870 533897 549242 542277

730654 619923 80681 4641 945810

403894 791515 299325 794329 44805

274761 525591 385985 945151 992758

318335 539269 903 48240 309176

145343 136920 915788 283919 935245

536815 503129 94206 914137 190263

787092 291119 231701 970030 931558

470049 439649 880473 714855 296141

131667 724193 183666 219762 671025