With the HashChain applet, create an array with 25 cells, and then fill it with 50 items, with a load factor of 2.0. Inspect the linked lists that are displayed. Add the lengths of all these linked lists and divide by the number of lists to find the average list length. On the average, you'll need to search this length in an unsuccessful search. (Actually, there's a quicker way to find this average length. What is it?)