Q:Question:the task of sorting n=1000,32 bit binary keys. You have decided to use radix sort (which uses counting sort as a stable sorting algorithm subroutine) for this problem but you are unsure whether to use counting sort on each bit separately or whether to use counting sort on groups of bits to minimize the total running time. You want to find out whether it is best to assign 1,4,8 or 16 bits per group and perform to the counting sort on each groupA:Answer:#bits/groups #group(d) # possible values per group...