Any help would be appreciated

1,write programs to implement the algorithm of Hw#1(Part-1) and compute the CPU time for different sets of unsigned integers generated by a random number generator 2. Write programs to implem ent the algorithm of HW#1(Part#2) using uastsetand itsetstructure) and compute the CPU time for different set of integers generated by a random number generator Test both parts using the same data sets: at least three of size 1000 integers, at least three of size 10000 integers, at least three of size 100000, at least three of size one million integers, and at least three of size 10 million integers Summarize the CPUT times using the following table format. Use system.nanoimel) to compute the spu time. Submit the source code of your program and the output of your test data. CPU time forCPU of sorted sorting the data set using algorithm(Parti) arrays using arrays using arrays using a Java sort function CPU time for CPU of CPU of unsorted Data Set m(size ) arrays unsorted unsorted algorithms of HasHset Part (Sum of the previous two columns Bitset Optional Extra credit 1. CODE: int printlntersectionlint arr1[]. int arr2], int m, int n) inti- 0,j 0; while (i