1. Write a modified version of selection sort algorithm that selects the largest element each time and moves it to the end of the array, rather than selecting the smallest element and moving it to the beginning. 2. Write a modified dual version of the selection sort algorithm that selects both the largest and smallest elements on each pass and moves each of them to the appropriate end of the array.

(JAVA ECPLISE)

*different from the regular selection sorting and please print out the outputs for each of the methods

Thank You!!