Select the option which best matches the meaning of: f(n)(n2) For sufficiently large values of n, there exists an input of size n which causes the algorithm to do at most cn2 multiplications (for some choice of c ). For sufficiently large values of n, every input of size n causes the algorithm to do at least cn2 multiplications (for some choice of c ). For sufficiently large values of n, every input of size n causes the algorithm to do at most cn2 multiplications (for some choice of c ). You cannot analyze a worst-case running time using , so the statement is meaningless. For sufficiently large values of n, there exists an input of size n which causes the algorithm to do at least cn2 multiplications (for some choice of c )