The upper bound of an algorithm with best case runtime T$($N$)=3$N$+16$ and worst case runtime T$($N$)=4$N$^2+10$N$+5$ is

$7$N

$7$N$^2$

$19$N$^2$

$4$N$^2+10$N