Consider the Fibonacci function, F ( n ) (see Proposition XXXXXXXXXXShow by induction that F ( n ) is ((3/2) n ).   Perform an experimental analysis that compares the relative running times of the...

Consider the Fibonacci function,
F(n) (see Proposition 3.20). Show by

induction that
F(n) is ((3/2)
ⁿ
).

Perform an experimental analysis that compares the relative running times

of the functions shown in Code Fragment 3.10.

Perform experimental analysis to test the hypothesis that Python’s sorted

method runs in
O(nlog
n) time on average.