2 You have weird that array looks like this: a, a, b, az, at, bzw. ananoby where the ai's are in order increasing and the bi's and all bits are bigger than allais are in in increasing orter, egi 2,620, 8, 9, 25, 11, 17, 32 Denise the most efficient sorting algorithm for this an array @ Write the pseudo-roter Give that complexity. which sorting algorithms from somester inspired you to your algorithm 6 a come up with