use python- please dont use previous answers they are incorrect

Write a program to perform Search and Sorting on randomly generated 10,000 and 50,000 integers. 1. Generate at least 10000 random numbers and store those in a list (name the list as Pool). 2. Generate a random number and call it as Target (use random.randint ()). 3. Perform Linear Search and Binary Search to find Target in Pool. write each as a function. Note: Binary search can be performed on sorted integers. Perform a sorting (call a sorting function) before calling binary search. 4. Perform Max/Min number search on the unsorted list. write each as a function. 5. Find/Search whether the unsorted list have distinct numbers. If it have distinct numbers return true and return false otherwise. If false, print the numbers which are not distinct. write it as a function. 6. Calculate the time taken for each function to perform the search. Note: for binary search, do not include the time taken for sorting the list. 7. Perform the following sorting on the Pool (write each as a function): - Selection Sort - Insertion Sort - Bubble Sort - Merge Sort. - Create a class file and call it as SearchClass. SearchClass should contain the search functions including max/min and distinct functions. - Create another class file and call it as SortingClass. SortingClass should contain all the sorting functions. - Call these appropriate class in your main class/function to perform the operations