I'm stuck with this homework I got from my Algorithms course:

> 
> Write a recursive function with a runtime of Theta(n^4 logn).
> 
> 
> 

I thought something like this, but I'm very unsure about my approach.

```
function(int n)
{
   for-loop (1..n^4)
     //do something

   return function(n/2);
}

```