Use induction to show that a factorial time algorithm n$!$ is slower than an exponential time algorithm with constant base $2^$n for any reasonably large problem.