given a linear time algorithm to sort the ratios of n given pairs of integers between 1 and n. for example we must sort within O(n) time, n laura is the form (Ai,Bi) where these two are in between 1 and n (and can be equal to 1 and n) using the sort key (Ai,Bi) . prove the correctness and runtime is the algorithm

Give a linear-time algorithm to sort the ratios of n given pairs of integers between 1 and . Le., we need to sort, within O(n time, pairs of the form (ai, b) where 1 s a, S and 1 b using the sort key . Prove both run-time and correctness. Give a linear-time algorithm to sort the ratios of n given pairs of integers between 1 and . Le., we need to sort, within O(n time, pairs of the form (ai, b) where 1 s a, S and 1 b using the sort key . Prove both run-time and correctness