What is the time complexity of the following code represented in terms of Big Oh?

What is the time complexity of the following code represented in terms of Big Oh?

Sample2(n)

count = 0

for (i=n/2; i<= n; i++)

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

for (k=n;k>=1; k–)

break