What is the appropriate big$-$Oh notation of time complexity t in the following code snippet?

int findbigoh$($int values$[],$ int n$)$

$\{$

int t $=0$;

for $($int i $=0$; i $<$ n; i$++)$

$\{$

for $($int j $=0$; j $<$ n; j$++)$

$\{$

for $($int k $=0$; k $<$ n; k$++)$

$\{$

t $=$ t $+$ values$[$i$]*$ values$[$j$]*$ values$[$k$]$;

$\}$

$\}$

$\}$

return t;

$\}$

Question $10$ options:

O$($n$2)$

O$($n$3)$

O$($n log$($n$2))$

O$($log$($n$3))$