Devise an algorithm that arranges the elements of a length‐n integer array according to the following scheme: position 0: the smallest integer position 1: the largest integer position 2: the second smallest integer position 3: the second largest integer etc. For example, this algorithm would arrange the input array {1, 2, 17, -4, ‐6, 8} as follows: {-6, 17, -4, 8, 1, 2}. (Notice that –6 is the smallest, 17 the largest, -4 second smallest, 8 second largest, etc.) Then answer the following: A. What is the asymptotic running time of your algorithm? B. Prove that it is impossible to obtain an algorithm to sort an integer array, in the way described above, that runs asymptotically faster than the algorithm you created in Part A.