Calculate complexity function f(n) of the following algorithm:

Please do count the frequency of everything inside the for loop. int i,j,k, count=0; // this step take 1 unit time for(i = n/2; i <= n; i++) { for(j = 1; j+n/2 <= n; j++) { for(k = 1; k <= n; k = k*2) { count++; } } } Note: n/2, j+n/2, j++, k=k*2 as 1 step unit