Solve the time Complexity of the above code snippet. Please include details step by step. I don't need the answer alone. I'll definitely show an upvote to your answer if it's correct and explicit....

Solve the time Complexity of the above code snippet.

Please include details step by step. I don't need the answer alone.

I'll definitely show an upvote to your answer if it's correct and explicit.

Thanks for your help!

Extracted text: Input: marks[n], n > 9 Output: minimum mark of top 10% 1 2 3 4 top floor(n/10) %3D for a = 0; a++ ... 6. if (0 == 0){ 1 ... top++ for j = 0 ... n - i if marks [n-i] < marks="" [j]="" swap="" (marks[n-i],="" marks[j])="" 7="" for="" i="" 8="" 9.="" 10="" 11="" return="" marks[n="" -="" top]="" 12="" 13="" else="" {="" print("next="" number)="" for="" i="1" ...="" top++="" print(i)="" swap="" (marks[i],="" marks[i+1])="" 14="" 15="" 16="" 17="" 18="" }="" 19="" 20="">