Four algorithms for doing the same task have complexities of A: n

$3/2$

$,$ B: n log$2$ n$,$

C: n$($log$2$ n$)$

$2$

$,$ and D: $$

n log$2$ n$.$ Rank the algorithms in order of increasing efficiency for large values of n$.$