Please read everything the question is asking about. This is my 2nd time posting this question.

Analyze the following code and determine its approximate running time and worst-case time complexity. Assume input size is n. Show all step counts. Give Big-Oh of the time complexity (n) and prove it. > 4 Cur 1 def sort (A) : Sort list into nondecreasing order.** for k in range (1, len (A)): A[k] j - K while j > O and A[j-1] > cur: A[jl - Aj-1] --1 3 All cur