Using c++ Create this program in this given instructions. Using a random number generator, create a list of 500 integers. Perform a benchmark analysis using some of the sorting algorithms from this chapter. What is the difference in execution speed?

Notice that all of the data in the inner lists are represented as strings. You are to write the function convert_data, which should make modifications to the inner lists according to the following rules: If and only if a string represents a whole number (ex: '3' or '3.0'), convert the string to an int. If and only if a string represents a number that is not a whole number (ex: '3.14'), convert the string to a float. Otherwise, leave the string as a str.HINT: The provided helper function is_number may be used (attached image). QUESTION: Complete the docstring below.def convert_data(data: List[list]) -> None:    """Convert each string in data to an int if and only if it represents a    whole number, and a float if and only if it represents a number that is not    a whole number.     >>> d = [['abc', '123', '45.6', 'car', 'Bike']]    >>> convert_data(d)    >>> d    [['abc', 123, 45.6, 'car', 'Bike']]    >>> d = [['ab2'], ['-123'], ['BIKES', '3.2'],…

Implement the following two sorting algorithms in a program called p3.py. Write two separate functions for these algorithms. Both functions must take a list of integers as the input parameter.1) Bogosort: first shuffle the list argument (i.e., randomize the positions of every element) and then check to see if the result is in sorted order. If it is, the algorithm terminates successfully and returns True, but if it is not then the process must be repeated.2) Bozosort: choose two elements in the list at random, swap them, and then check if the result is in sorted order. If it is, the algorithm terminates successfully and returns True, but if it is not then the process must be repeated.Write a main() function and call both sorting functions using the same list as their arguments. The list can be of any size (try a small list first). Does any of your algorithms terminate? If yes, count the number of iterations it uses to sort the list. Does it always use the same number of repetitions? If…

Write down the quick sort algorithm in python. Consider one random example and execute the code.   The random example should also be provided before the code which is used to execute the code.   Code with comments and output screenshot ( no copy paste please)