Is this a true statement? "The time complexity of my algorithm is at least O(nlog n)" a) True b) False What is the growth of the below function: (What is the most accurate answer?) f(n) = V2 + 2logn1/2 + nlogan + logn" a) 0(2) b) (nlogn) c) (nlogn) d) (vn) e) Neither