To show that f(n) is lower bound of g(n), I can write f(n) = _ a) 0 (g(n)) b) (g(n)) c) (g(n)) What is the growth of the below function: (What is the most accurate answer?) f(n) = Vnlogn + 2logn + logn +logn" a) b) c) d) e) (Inlogn) (nlogn) (vn) (log?n) Neither