What is the time complexity of the below function?

void fun$($int n$,$ int arr$[])$

$\{$

int i $=0,$ j $=0$;

for$($; i $<$ n; $++$i$)$

while$($j $<$ n && arr$[$i$]<$ arr$[$j$])$

j$++$;

$\}$

Question $3$ options:

O$($n$^2)$

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

O$($n$)$

O$($n log n$)$