this is the full question with the two parts

(b) (5 points) Measure the running time of your program for N=10000,20000,40000, 80000 and 160000. i. (2.5 points) Present the results in the following table: ii. (2.5 points) Plot the results using an Excel chart (see the example below) (a) (5 points) Implement the Selection Sort algorithm on a randomly generated list of N integer numbers. Your program should output only the running time. To measure the sorting time, you can call system. currentTimemillis () just before and just after the sorting and take the difference (you need to import java.util.concurrent. TimeUnit). Submit on Moodle a copy of your source code file named as HW1XXXXXX.java where XXXXXX is your ID. (b) (5 points) Measure the running time of your program for N=10000,20000,40000, 80000 and 160000. i. (2.5 points) Present the results in the following table: ii. (2.5 points) Plot the results using an Excel chart (see the example below) (b) (5 points) Measure the running time of your program for N=10000,20000,40000, 80000 and 160000. i. (2.5 points) Present the results in the following table: ii. (2.5 points) Plot the results using an Excel chart (see the example below) (a) (5 points) Implement the Selection Sort algorithm on a randomly generated list of N integer numbers. Your program should output only the running time. To measure the sorting time, you can call system. currentTimemillis () just before and just after the sorting and take the difference (you need to import java.util.concurrent. TimeUnit). Submit on Moodle a copy of your source code file named as HW1XXXXXX.java where XXXXXX is your ID. (b) (5 points) Measure the running time of your program for N=10000,20000,40000, 80000 and 160000. i. (2.5 points) Present the results in the following table: ii. (2.5 points) Plot the results using an Excel chart (see the example below)