text: Consider the situation when Selection Sort is used to sort an array of n elements into ascending order, but the elements are originally arranged in descending order. Find the complexity of the Selection Sort algorithm in this case in big-O notation