What is the Big O notation for a recursive function with a runtime complexity of T$($N$)=5$N$+$T$($N$1)?$

Question $3$ options:

O$($N$$logN$)$

O$($N$^2)$

O$($N$^2$logN$)$

O$(5$N$^2$logN$)$