Consider the following log-log plot of running times for an algorithm on inputs of various sizes: 101 100 Running time Tin) 10-1 10-2 100 101 Input sizen Which of the following aymptotic bounds on the running time T(n) is most likely: Select one: 0 T(n) = 9(2"). 0 T(n) = 9(n). OT(n) = (na). O T(n) = (log n)