Algorithm A runs in time f$($n$)=7\backslash$times $2$n$+$n$2+$nlog$($n$)$

Algorithm B runs in time g$($n$)=3\backslash$times $21\mathrm{.}2$n$+$n$4+$n$2$

Which algorithm is asymptotically faster?