•suppose that a particular algorithm has time complexity t(n) = 10 ∗ 2n, and that execution of the algorithm on a particular machine takes t seconds for n inputs. now, suppose you are presented with a machine that is 64 times as fast as your current machine. how many inputs can you process on you new machine in t seconds?

The number of inputs processed by the new machine is 64

Solution:

As per the question:

The time complexity is given by:

where

n = number of inputs

T = Time taken by the machine for 'n' inputs

Also

The new machine is 65 times faster than the one currently in use.

Let us assume that the new machine takes the same time to solve k operations.

Then

T(k) = 64 T(n)

k = 64n

Thus the new machine will process 64 inputs in the time duration T

answer:

the fed will purchase bonds from banks to inject money into the banking system. the banks can use these funds to provide loans to individuals and businesses.

explanation:

answer:

explanation:

sbbdbdbdbdbdndjd