Suppose you are sorting 16 million 64-bit integers with Radix sort. Suppose you are doing a Radix-2 sort, i.e. Binary sort. You have done four passes on the four most significant bits. How many...

Please this is one question

Extracted text: Suppose you are sorting 16 million 64-bit integers with Radix sort. Suppose you are doing a Radix-2 sort, i.e. Binary sort. You have done four passes on the four most significant bits. How many different combinations of those first four bits are there, i.e. how many different values of a 4 bit number? Each number will end up in a group of numbers with the same first four bits. How many such groups will there be? About how many numbers will be in each group? (Hint: how many numbers are there? How many groups are they divided into?) Would it be fast to do a pass of Insertion sort on the numbers after four passes of Radix-2 sort? OYes ONo Suppose instead you do three passes of Radix-256 sort, i.e. sorting by byte columns, so that the 3 most significant bytes are sorted. About how many numbers will be in each group? Would it be fast to do a pass of Insertion sort on the numbers after three passes of Radix-8 sort? OYes ONo If you number the bytes of a 64-bit integer 1 through 8, with 1 being the most significant byte, and if you do 3 passes of LSD Radix-256 sort followed by a insertion sort, what column (byte) would you sort by first (1..8)?