Indexed Sequential Access Method (ISAM) is combination of contiguous and linked list implementation. Initially, key is hashed to create the index into \array For instance, array may have 26 entries, each representing letters of alphabet. Hash function will take first letter of the key and find it's position 1-26 in array. In array is pointer to linked list of nodes each of which starts with corresponding letter. Write algorithms to insert the entry into list and to find entry in the list.