When implementing an ADT for a set of data S, |S| = 4^10, it is determined that a search operation, search(x, S), requires 0.005 seconds to execute. If the complexity of the search operation is given by the following closed-form expressions T(n), compute the time required to execute this operation when |S| = 4^20. (a) T(n) = 9log n. (b) T(n) = 65n - 2. (c) T(n) = n^3. (d) T(n) = 2^n