Algorithm $1$ needs exactly $5$n flops and algorithm $2$ needs exactly n$^2$ flops to carry out the same computation. When is algorithm $1$ faster than algorithm $2?($Note: We consider only the flops to determined the speed of the algorithm$)$

$-$When n is greater than $5$

$-$When n is smaller than $5$

$-$For every n