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 n+1 B 100 D 21-1 E 100logn+n Algorithm Algorithm E Algorithm D Algorithm A Algorithm B Binary expansion of (485 mod 286)10 is ( 12 Decimal expansion of the number with hexadecimal expansion (C9)16 is ( 010