show me in java or python, this solution thanks. This task requires you to produce a fully working programme, which will compare operation times of various sorting algorithms for given set of data. You should carefully consider the criteria below and then develop a fully documented program that will calculate the time taken to sort lists of 10, 100, 1000, 10000 integer numbers. There should be a minimum of 3 sorting algorithms used in the program, including an insertion sort, a bubble sort and another sorting algorithm of your choice. You must write a report that includes the following: A description of each algorithm used, including pseudo code and/or flowcharts A full code listing with comments A table of results showing the time required for each algorithm to execute once. Use the speed of insertion sort as a guide to compensate for different processor speeds. An explanation of how the timing of each algorithm is achieved. Justification of the best sorting algorithm to be used for the various data sets supplied