Solve exercise 4 from section 8.8. See the notes from CSC216 (Data Structures) for more on timing analysis in general. Show your comparison with a nice graph or two. (Plot time versus N. Remember that you can legitimately test factorials that fit within a 64-bit frame -- not just the 12! noted in the book.) Your graphs can use raw (millisecond) or adjusted (scaled, averaged, etc.) timings. Include a discussion of how the two algorithms' space needs differ.

As always, document any procedures you create well!

This assignment is Level 3.5.