Q$1$: Assume that a Merge sort algorithm in the worst case takes $30$ seconds for an input of size $64.$ Which of the following most closely approximates the maximum input size of a problem that can be solved in $160$ seconds?

a$.256$

b$.1024$

c$.2048$

d$.512$