Please solve by expert and make it clear to understand step by step and make your hand write clear

Task 1 Random number generation - Create rondom ber generator to create a list of unique Integers (each number must appear only once. The code for this generator can be obtained from the internet. It must be able to generate at least 300 ingested numbers by using your matric ID as a seed generator. Write the pseudocode of the function in your report Task 2: Searching implementation - Implement linear search interpolation search and binary search to Search an integer from a list of integers. The code for these gorithms can be obtained from the internet les http://www.geekforpeeks.on. However, detail remarks (comments by using your own words are required to be provided in the code to show your understanding of the code. Each function must be accompanied by comments. Extra mark will be puen you implement additional searching algorithms for this task. Task 3 complexity Analysis. Theoretically discuss and compute the complexity of all searching algorithms that you implemented. The discussion will describe your understanding of the algorithm. Put the complexity on a table as shown in Table 1 and Execution Time in milliseconds as shown in Table 2. Table 1: Complety Analysis Algorithm Algorithm 1 Algorithm 2 Complexity Olen Table 2: Execution Time in seconds) Aiorithm Arch Alcorithm 100 integers 200 integer 300 integers Task 4Testing. Create a main function which is able to call the number generator and all algorithms. Apply the testing procedure Searching By using the function from Task 1. generate 100 unique integers. Output the list in a 100data txt or 100data.csv file. Get the last integer in the list as Read the integers from the file in an amayor linkedit Apply the algorithms in Task 2 to findk from the list. Record the time takes by each of the algorithms as shown in Table 2 Repeat the process with 200 and 300 unique magers 214551GNMENT CAA EKT 226 Tasks: Writing Report - Write the report. The reportat contain The description of each function in the code the input output what it does reference to the source of the code you get the code from the internet) The complexity analysis using Big Ontation and the time taken in milliseconds) to execute your number generator and each searching algorithms in your program (see Table and Table 2) E Table Complety Analysis Algorithm Algorithm 1 Complexity DO 1 Table 2: Execution Time in milliseconds) Algorithm 1 Algorithm 3 Algorithm 100 integer 200 integers 300 Integer Task 1 Random number generation - Create rondom ber generator to create a list of unique Integers (each number must appear only once. The code for this generator can be obtained from the internet. It must be able to generate at least 300 ingested numbers by using your matric ID as a seed generator. Write the pseudocode of the function in your report Task 2: Searching implementation - Implement linear search interpolation search and binary search to Search an integer from a list of integers. The code for these gorithms can be obtained from the internet les http://www.geekforpeeks.on. However, detail remarks (comments by using your own words are required to be provided in the code to show your understanding of the code. Each function must be accompanied by comments. Extra mark will be puen you implement additional searching algorithms for this task. Task 3 complexity Analysis. Theoretically discuss and compute the complexity of all searching algorithms that you implemented. The discussion will describe your understanding of the algorithm. Put the complexity on a table as shown in Table 1 and Execution Time in milliseconds as shown in Table 2. Table 1: Complety Analysis Algorithm Algorithm 1 Algorithm 2 Complexity Olen Table 2: Execution Time in seconds) Aiorithm Arch Alcorithm 100 integers 200 integer 300 integers Task 4Testing. Create a main function which is able to call the number generator and all algorithms. Apply the testing procedure Searching By using the function from Task 1. generate 100 unique integers. Output the list in a 100data txt or 100data.csv file. Get the last integer in the list as Read the integers from the file in an amayor linkedit Apply the algorithms in Task 2 to findk from the list. Record the time takes by each of the algorithms as shown in Table 2 Repeat the process with 200 and 300 unique magers 214551GNMENT CAA EKT 226 Tasks: Writing Report - Write the report. The reportat contain The description of each function in the code the input output what it does reference to the source of the code you get the code from the internet) The complexity analysis using Big Ontation and the time taken in milliseconds) to execute your number generator and each searching algorithms in your program (see Table and Table 2) E Table Complety Analysis Algorithm Algorithm 1 Complexity DO 1 Table 2: Execution Time in milliseconds) Algorithm 1 Algorithm 3 Algorithm 100 integer 200 integers 300 Integer