For each of the problems below use Selection as a black box algorithm to derive an O(n) time algorithm. It is common these days to hear statistics about wealth inequality in the United States. A typical statement is that the the top 1% of earners together make more than ten times the total income of the bottom 70% of earners. You want to verify these statements on some data sets. Suppose you are given the income of people as an n element unsorted array A, where A[i] gives the income of person Describe an algorithm that given A checks whether the top 1% of earners together make more than ten times the bottom 70% together. Assume for simplicity that n is a multiple of 100 and that all numbers in A are distinct. You do not need to formally prove the correctness of the algorithms but they should be clear and high-level. You need to justify the running time of your algorithms. For each of the problems below use Selection as a black box algorithm to derive an O(n) time algorithm. It is common these days to hear statistics about wealth inequality in the United States. A typical statement is that the the top 1% of earners together make more than ten times the total income of the bottom 70% of earners. You want to verify these statements on some data sets. Suppose you are given the income of people as an n element unsorted array A, where A[i] gives the income of person Describe an algorithm that given A checks whether the top 1% of earners together make more than ten times the bottom 70% together. Assume for simplicity that n is a multiple of 100 and that all numbers in A are distinct. You do not need to formally prove the correctness of the algorithms but they should be clear and high-level. You need to justify the running time of your algorithms