1. The problem statement, all variables and given/known data 1. f(n) = log(n) ^ (log(n)). Simplify for Big-O notation. 3. The attempt at a solution 1. I'm just trying to prove a big-O notation for one of my courses, and this was simplified to f(n) = n^log(log(n)) And I'm having a hard time seeing why. Any guidance would be appreciated.