Undergraduate students are surprised to learn that as much intellectual energy has been invested in sorting and searching as almost any other part of computer science. think of duke energy's customer database—it’s huge. new customers have to be added, former ones deleted, bills must be sent out, customers send in their payments and inquire about their accounts. an efficient data organization is required for duke to function at all. the first attack on organizing data involves sorting data elements into some order, and exploiting that order when trying to retrieve a particular element. hundreds of sorting algorithms have been developed, and like all sorting algorithms, selection sort accomplishes its task by making comparisons and data movements. we often compare algorithms by counting the number of comparisons and movements required—the fewer the better. this begs the question, how many comparisons and movements does the selection sort make? and, are these actions affected by the initial arrangement of data values in the array? this is the focus of this lab. start with the selectionsort class in the zip file attached to this item. keep the name selectionsort, and add a main method to it.