Same question above EXCEPT now you are doing the strategy of DOUBLING THE ARRAY each time it filles up. A: the total TIME complexity required in terms of N would be O(log2N) B: the total TIME complexity required in terms of N would be O(N) C: the total TIME complexity required in terms of N would be O(N squared) D: the total TIME complexity required in terms of N would be O(2 to the N) OB OD