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 Write an efficient function that compute the intersections of two sorted arrays of integers Write an efficient function that compute the intersection of two arrays of integers (not necessary sorted) 1. 2. 2. Write programs to implement the algorithmofHW#1(Part#2) using HashSet and BitSet structure) 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.nanoTime) to compute the cpu time This is the HW#1 HW 1 if (a1 a2]) CFU time for CPU of sorted CPU time for CPUof orting the arrays data set using algorithm(Part1)arrays using arrays using arrays using o Java sort function CPU af unserted Data Set unsorted unsorted else elgorithms of Hasiset Partll (sum of the previous two columns BitStt cout