Run time complexity of an algorithm which processes an array of N items can be defined as T(N)=aNb. See the run time recorded for different N in Table below. Solve b using log(T(2N)/T(N)). Use this to approximate the complexity? How long it will take possibly for N=64 a. 32768 b. 256 c. 8192 d. 2048