Can I have Cheeky Retorts for $100 Alex. 1. If you have a very large (say 100 million elements ) array in descending order, you can use Bubblesort to sort it i

Can I have Cheeky Retorts for $100 Alex. 1. If you have a very large (say 100 million elements ) array in descending order, you can use Bubblesort to sort it in the ascending order - the worst case complexity is kn^2, and this is literaly the worst case, so its the equivalent of a sleep(t) routine for a large t ( depending on how sow your system is). 2. If you have a very small array (say n < 10), you can create toy examples where kn^2 < m*nlogn, for carefully chosen values of k, m & n. Say n = 3, k = 1, m = 7.