Trace Algorithm 1 when it is given n = 5 as input. That
Chapter 6, Problem 1E(choose chapter or problem)
Trace Algorithm 1 when it is given n = 5 as input. That is, show all steps used by Algorithm 1 to find 5!, as is done in Example 1 to find 4!.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer