Implement a modification of the SelectionSorter class that reorders the array to have even elements followed by odd ones. Follow the basic steps of the selection sort algorithm. Locate the next even element and swap it with the current one. The algorithm places the even elements first, maintaining their original order. The odd elements may be in a different order. For example,

     [2,5,6,3,4,6,9,1,2]
     [2,6,5,3,4,6,9,1,2]
     [2,6,4,3,5,6,9,1,2]
     [2,6,4,6,5,3,9,1,2]
     [2,6,4,6,2,3,9,1,5]