Consider the following code and choose the right algorithm used in the following code. public static > void sortMe(T[] data){ int position, scan; T temp; for (position = data. length - 1; position >= 0; position--) { for (scan = 0; scan <= position - 1; scan++) { if (data[scan]pareTo(data[scan+1]) > 0) swap(data, scan, scan + 1);