What steps are required in determining the Big-Oh notation for the algorithm when sorting an array of integers 5 7 4 9 8 5 6 3 and showing the contents each time a selection sort changes it while sorting the array into ascending order and descending order? Basically, I need to come up an evaluation of the Big-Oh notation before coing up with a Java program to sort the elements in ascending and descending order