Perform an asymptotic analysis of the insertion-sort algorithm given in picture. What are the worst-case and best-case running times?

public static void insertion Sort(char[ ] data) { int n = data.length; for (int k = 1; k 0 && data[j-1] > cur) { data[i] = data[j-1]; j--; } data[j] = cur; }