Given an objective function that describes the number of statements in terms of an input size N select a tight big$-$O bound for the algorithm.

Group of answer choices

$1/2(3$N $+5+$ N$)$

O$($N$)$

$2$N $+5+$ N$^4$

O$($N$^4)$

N$!+2$N