Programs 9.9 and 9.10 implement a priority queue using a doubly-linked list, with dummy head and tail nodes. discuss the effect each of the following changes would have on priority queue operations (that is, list the operations that would be affected, and explain the performance effect).
a. using a singly-linked list instead of a doubly-linked list
b. not using dummy nodes
c. not maintaining a tail pointer.

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?