Programmatically generate three type of arrays of size 1000: an array that is sorted in ascending order, a reversed array (an array that is sorted in descending order), and a random array. Programmatically sort the three arrays using insertion sort, merge sort, quick sort, heap sort, counting sort and radix sort. For each sorting algorithm, calculate the number of the number of comparisons (see below) Discuss whether your results match the big O of these algorithms. Summarize the table below Comparing the number of comparisons Random Array Sorted Array Reversed Array Insertion Sort Mg Sort Heap Sort Quick Sort Conting Sor Radix Sort