I already wrote the code but I want to know which algorithm is faster

Write a program to test the performance of insertion Vs selection sort. Also, show the output after execution. The Output will be varying for each student. (Hint: you can use System.nanoTime) to measure the time is taken to perform the insertion sort and selection sort on random numbers) d. Paste the output in the space provided, analyze the output, and explain which algorithm is faster