hello, I'm having trouble solving this question in algorithm and programming techniques..

Q1: n Use Compiler of any programming language to create array A= [n), Generate A randomly as follows, then apply insertion and selection, bubble sort, Marge-sort, Quick sort for the same generated array. You should find the execution time for each algorithm of n items Insertion sort Selection sort bubble sort Marge sort Quick sort 100 500 1000 5000 10000 50000 100000 1000000