Radix Sort

1. What's the time complexity of Radix Sort?
n is the number of elements & d is the maximum number of digits in any element of the array.

a: O(n*d) b: O(n+d) c: O(n^2) d: O(d)

2. Radix Sort has O(1) space complexity

a: True b: False