what is the time complexity of the following algorithm?Bound the running time with Big-O.Show the calculation of how you find the running time

algorithm_1(n)

for (i=1; i,= n-1; i++):

for (j=1;j<=n; j++):

for(x=1;x<=i;x++):

max=max+1;