Calculate the running time complexity (Worst-case and Best case) and asymptotic Time complexity (worst-case and best case) of the following Algorithm and also show working.

Sample (ref int[] A, im N) for (int i - 1 ; i < length[A]- I; i++){ value - A[i] j= i - 1 while ( j>=0 and A[j]) > value) do{ A[ j+1] = A[j] j=j-1 for (int j=1; j < N; j++) *NOTHING" } for (int k = n; k > 0; k /= c) { print "Cats are Cute!" }