Func5(n)
1 s=0;
2 i=6;
3 while (i < n^(5/2)) do
4 j=4;
5 while (j < 5i) do
6 s=s + i - j;
7 j=j + 9 ;
8 end
9 i=4 * i ;
10 end
11 return (s);
So far I got the upper bound for this function is O(n^(5/2)log(n)) and I am not sure if or not this is the closest upper bound we can get. And I have no clue how to show the lower bound with the same function.
