Five algorithms A$1,$ A$2,$ A$3,$ A$4,$ A$5$ solve a problem with order f$1($n$)=50$log$($log n$)+20,$ f$2($n$)=10$nlog$2$n $+100,$ f$3($n$)=10($log n$)2+100,$ f$4($n$)=100$n$2-3$n $+6,$ f$5($n$)=$ n$2/8-$ n$/4+2,$ respectively. The algorithm$($s$)$ with highest time complexity is $($are$)$

$[$ A $]$ A$1$

$[$ B $]$ A$2,$ A$3$

$[$ C $]$ A$4$

$[$ D $]$ A$4,$ A$5$

$[$ E $]$ A$5$