I need a program that contains an algorithm whose
Big-Θ is exponential. An explanation of what n represents inthe
program. Make some assumption about how long it would take to
execute one of the operations that you are counting. Determinehow
large n would have to be so that the time required would exceeda
million years. Is there a more efficient algorithm that willsolve
the same problem? If so, describe it.
Expert Answer
An answer will be send to you shortly. . . . .