you need to explain how you get the answer - you need to show the steps

What is the Big-O notation for the following code?

for(int i=n; i>=0; i--)

{ k = 1; while(k<=1000)

{ k++; j=1; do{ j++; }

while(j<=n);

}

}