Prove that the DoubleMinMaxSort algorithm below is also incorrect. Input: data: array of integers Input: n: length of data, must be even Output: permutation of data such that data[1] greaterthanorequalto data[2] greaterthanorequalto ... greaterthanorequalto data[n] Algorithm: DoubleMinMaxSort data = Min Max Sort(data) if data is sorted then | return data end return MinMaxSort (data)