Considering the asymptotic complexities of the following functions, what is the right choice to sort them in decreasing order

f$1($n$)=2$n

f$2($n$)=$ n$(3/2)$

f$3($n$)=$ n$*$log$($n$)$

f$4($n$)=$ nlog$($n$)$

Select one:

a$.$ f$3,$ f$2,$ f$1,$ f$4$

b$.$ f$1,$ f$4,$ f$2,$ f$3$

c$.$

f$2,$ f$3,$ f$4,$ f$1$

d$.$ f$2,$ f$3,$ f$1,$ f$4$