Describe the algorithmic running time in Big$-$O notation:

T$($n$)=(5*$ n$)*(3+$ log n$)$

Group of answer choices

O$($n log n$)$

O$($n$)$

O$($log n$)$

O$(5$ n log n$)$