Rats

I hope the grader is willing to put some effort into the really hard problem on the Algorithms homework. I don't believe there is a tight bound. My solution, , is a loose upper bound, but it's waaaay tighter than the one the prof gave on the answer key:  . That thing explodes instantly. I'd hate to have to get into a grade argument on the first assignment, but I spent a week on that thing, so I'd like to get credit for it.