Given n numbers in hexadecimal format, each number has m digits. We call this data set, "data set A". We encode (convert) the numbers into Binary format. Let's ignore the encoding cost. The number in...

Extracted text: Given n numbers in hexadecimal format, each number has m digits. We call this data set, "data set A". We encode (convert) the numbers into Binary format. Let's ignore the encoding cost. The number in Binary format is called "data set B". We sort the numbers in both data sets using Radix sort. Proof that the time complexity (0) of Radix sort of data set B always is greater than the Radix sort for the data set A.