Suppose that you have five different algorithms (A, B, C, D and E) for solving a problem. To solve a problem of size n, the number of operations used by each algorithm is as follows. As n grows, which algorithm uses the fewest operations? Algorithm number of operations A n2+n 10 IB 2n+1 Ic logan 10 ID lan E n(log2n)2 +1 Algorithm Algorithm A O Algorithm D a Algorithm E Algorithm B