I'm including all the notes below if it helps. Please help me.

What is the complexity of the given code as a function of the problem size n? Show the (complete) details of your analysis. This is a Complexity Analysis, not a Complexity Estimation. You must follow the process presented in the Week-2B lecture, considering the Best Case, Worst Case and Average Case. Note: a [i] is an array with n elements. for (int i = 0; i 0.25) if (i%4 == 0) BubbleSort (a[i]); else QuickSort (a[i]); else for (int j = i; j 1; k--) { arMin = ar[0]; minPos = 0; for (int i = 1; i -1; i--) { i = x + 1; arTemp = ar[k]; while (i 0; i--) for (int i = 1; i