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