The running time of RadixSort to sort n integers, each represented by D digits in radix base B is $\backslash$Theta

$(\_\_\_\_\_\_\_\_\_\_)$

Question $3$Answer

a$.$

n$($B$+$D$)$

b$.$

BDn

c$.$

D$($B$+$n$)$

d$.$

B$($D$+$n$)$