Student A has a latest computer that is X times faster than Student B. Suppose that Student B s computer can execute a program on input of size N in one hour. Find the size of the input that can Student A s computer execute in the same time if the algorithms growth rate is Y?

X = 100, Y = n^2

X = 64, Y = 8n

X = 16, Y = n

X = 16, Y = log(n)