simple sorting algorithms

O(n²) sorting algorithms Bubble, Insertion and Selection Sort are all quite short -- implement all of them as a Fortran subroutine for sorting an array A of numbers of length n. Test that it works by sorting 10 numbers in reversed order (10,9,...,2,1), sorted order (1,2,...,9,10) and random order. Expand the simple testing code to a "test harness" so that you can plot a graph of the CPU_TIME the algorithm takes to sort lists of numbers from, e.g., 10..100 with one line each for inputs in: inverted order sorted order random order (to get stable statistics you'll need to average over a number of runs using RANDOM_NUMBER to setup the unsorted list) Plot three lines on the same graph and explain any differences or changes, e.g. by annotating the graph.