Generate an array of randomly-generated values of varying lengths. The array lengths must be minimally every 50,000 up to 500,000... in other words: 50,000, 100,000, 150,000, ..., 500,000. Execute the algorithms above (selection sort, bubble sort, insertion sort, merge sort and quicksort) against a copy of the array. Keep track of the algorithm, the running times and the algorithm execution time. Using an external tool eg. Google Sheets, OpenOffice Calc or Excel - produce a chart of the algorithm, the running times and the algorithm execution time. This chart must look like Figure 1, with additional data for merge sort and quicksort included. Time (ms) 500000 400000 300000 200000 100000 0 100000 200000 300000 Array Size 400000 Figure 1: Graph of algorithm execution times 500000 Insertion Sort -Bubble Sort - Selection Sort