Give an example of an array of N items that maximizes the number of times the test `a[j] < a[min]` fails (and, therefore, min gets updated) during the operation of selection sort (Algorithm 2.1).

Show, in the style of the example trace with Algorithm 2.1, how selection sort sorts the array E A S Y Q U E S T I O N.