Given n d-digit numbers in which each digit can take up to k possible values, prove that Radix Sort correctly sorts these numbers in (d(n+k)) time if the stable sort it uses takes (n+k) time.