There are two algorithms a and b for solving computational problem x. lets say we have somehow determined very precise expressions for running times of a and b on a computer. they are given to be 2n^2 and 8n. what is the lowest value of n where b will be faster than a?

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?