An algorithm called radix sort, which does successive iterations of another algorithm called counting sort, with each of those iterations focused on one digit  Suppose that you replaced counting sort, at each step, with a hypothetical algorithm that was faster than counting sort but was not stable. If you did, would you expect radix sort to still come up with a correct result?  Suppose that you sorted the digits in the opposite of the order that we specified, by fixing sorting by the most-significant

 An algorithm called radix sort, which does successive iterations of another algorithm called counting sort, with each of those iterations focused on one digit 

1. Suppose that you replaced counting sort, at each step, with a hypothetical algorithm that was faster than counting sort but was not stable. If you did, would you expect radix sort to still come up with a correct result? 
2. Suppose that you sorted the digits in the opposite of the order that we specified, by fixing sorting by the most-significant digit, then the second-most-significant digit, and so on. would you expect radix sort to still come up with a correct result?