Consider the following situation: A merge sort algorithm takes 48 seconds to run on an input array named arr The number of elements in arr is 8. For another array named data, the same algorithm on the same computer takes 320 seconds Which of the following most closely approximates the maximum input size of the array named data? Example: Lets say the algorithm take 16 sec. for an array of size 4. Then c* 4log 4 16, hencec 2. Now if this algorithm runs on an input array of size 8 then the time vwill be 2+ 8log8 2*8*3-48 Select one a. 32 b. 64 c. 5 d. 16