figure separate chaining in the hashchain workshop applet each element of the array occupies one line of the displayand the linked lists extend from left to right initiallythere are cells in the array ( liststhis is more than fits on the screenyou can move the display up and down with the scrollbar to see the entire array the display shows up to six items per list you can create hash table with up to lists and use load factors up to higher load factors may cause the linked lists to exceed six items and run off the right edge of the screenmaking it impossible to see all the items (this may happen very occasionally even at the load factor experiment with the hashchain applet by inserting some new items with the ins button you'll see how the red arrow goes immediately to the correct list and inserts the item at the beginning of the list the lists in the hashchain applet are not sortedso insertion does not require searching through the list (the example program will demonstrate sorted lists try to find specified items using the find button during find operationif there are several items on the listthe red arrow must step through the items looking for the correct one for successful searchhalf the items in the list must be examined on the averageas we discussed in "linked lists for an unsuccessful searchall the items must be examined load factors the load factor (the ratio of the number of items in hash table to its sizeis typically different in separate chaining than in open addressing in separate chaining it' normal to put or more items into an cell arraythusthe load factor can be or greater there' no problem with thissome locations will simply contain two or more items in their lists