Based on this what is the runtime efficiency of this algorithm in terms of order growth.

Base Case:

$-\backslash (\backslash$operatorname$\{$OPT$\}(0)=0\backslash )($no intervals can be scheduled if j $=0)$

Algorithm $($Pseudocode$)$:

$```$

WeightedIntervalScheduling$($intervals$)$:

n $=$ number of intervals

sort intervals by their finish times in ascending order

p $=$ array of size n$+1$

p$[0]=0$

for j $=1$ to n:

p$[$j$]=$ find$\_$previous$\_$compatible$\_$interval$($intervals$,$ j$)$

M $=$ array of size n$+1$

M$[0]=0$

for j $=1$ to n:

M$[$j$]=$ max$($M$[$j$-1],$w$($j$)+$ M$[$p$[$j$]])$

return M$[$n$]$

$```$