Identify the basic operations and construct a recurrence relation C(n) that characterizes the time complexity of the algorithm. Determine the order of
growth for C(n) either solving the recurrence relation or using the Master
Theorem if appropriate. You may assume that n = 2k for some integer k.
Foo6 (n)
// Description: …
// Input: a positive integer n
// Output: …
if n = 0
return 1
if n = 1
return 2
else if n % 2 = 1
return Foo6(n/2) * Foo6(n/2) * 2
else
return Foo6(n/2) * Foo6(n/2)

Problem 1 - hashing we would like to use initials to locate an individual. for instance, mel should locate the person mark e. lehr. note: this is all upper case. generate a hash function for the above using the numbers on your telephone. you know, each letter has a number associated with it, so examine your telephone keypad. generate 512 random 3 letter initials and take statistics on a linked list array size 512 to hold this information report how many have no elements, 1 element, 2 elements, does this agree with the hashing statistics distribution?