Write a function that takes in a pointer to the head of a linked list, a value to insert into thelist, val, and a location in the list in which to insert it, place, which is guaranteed to be greaterthan 1, and does the insertion. If place number of items aren’t in the list, just insert the item inthe back of the list. You are guaranteed that the linked list into which the inserted item is being

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?