intro to algorithms

5.)

5. (20 points) Help me with the "dirty work" of proving log41n=o(n) using the original definition of little-oh relation. Specifically, show that for any c>0, we can find an integer n0=n0(c) such that for all nn0,log41ncn. Basically you just need to find any such n0. (Of course, the smaller n0, the better your solution. Any solution that is better than mine will be awarded with 10 extra points)