The first thing that you need to do is to determine the recurrence relation 
for the algorithm.  Then, build the tree and think about where the actual 
work happens.  Finally, determine how much work there ends up being.

Note: This is a little different from most of the problems we have
      been looking at in an interesting way, so think carefully.