Given two algorithms, Sort(Array, Comparator) and StableSort(Array Comparator), what is the fastest way to sort the array while not undoing the work of the previous sorts. Assume the following: Sort0 is faster than StableSort0 . Sort0 is not stable . The values in the array are like (FirstName, LastName, Department, etc.) tuples. FirstName, LastName, Department, etc. are values in the tuples. Reminder: A Comparator is a way of specifying a way of comparing values in an Array, e.g.for overriding the default