$f(n)=(n \log n +1)^2 ,g(n)= (\log n +1)(n^2+1)$
If I must to solve this question by using limit, then answer will be too long
could I first simplify each function separately and find the big O of it then using the limit theorem ? or it cannot be done like this!??
if yes it would be like this
$\lim_{n \to \infty}=\dfrac{n^2log^2(n)}{n^2log(n)}$ so f(n) grow faster ?