public static void insertionsort$($int$[]$ data$)\{$

for $($ int i $=1$; i $<$ data.length; i$++)\{$

int element $=$ data$[$i$]$;

int j $=$ i;

$//$shift elements to the right as long as they are

$//$greater than element

for $($j $=$ i; j $>0$ && data$[$j$-1]>$ element ; j$--)$

data$[$j$]=$ data$[$j$-1]$;

data$[$j$]=$ element;

$\}$

$\}1\mathrm{.}1)$ Consider the selection sort implementation from slide #$34$ Slides $11.$ Change the code of this method to sort an array of things using same Thing you used in your homework assignments. Remember that things are sorted according to compareTo method.