Given a recursive function as below. predict the output for the inputs given. show the steps.

int x(int n)

{

if (n==1) return 5;

else

return n + x(n/2);

}

predict the value of x(10), show the steps of finding that out.

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?