For Homework $3,$ you had to make two different function to calculate factorials. One

used a for loop, and one used a recursive function that called itsself.

A$)$ Which of these function was faster for calculating large factorials? $($Say$,100!)$ You'll

needed to use

import timeit

or something similar to time the two functions.

B$)$ What is the largest factorial your functions can calculate as a floating point number,

before they return infinity? You might need to modify your factorial function to return a

float by setting the initial number $(0!)$ to $1\mathrm{.}0$ instead of $1$In $[]$: