Question 4 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 B 2n+ Ic 12-10 082n 10 ID Allogen)2+1 Algorithm Algorithm D Algorithm E Algorithm A Algorithm B