java

Describe the algorithm to search for an item with

Describe the algorithm to search for an item with given key, in a has table that uses open addressing with double hashing. Consider a class My List Implementation that keeps a doubly linked list with header and trailer sentinel nodes (referenced by instance variables of the list implementation called header and trailer). Assume that the Node class has the usual getter and setter methods. Suppose n is a Node within the list (not one of the sentinels). Write the sequence of Java statements that would be used within My List implementation, in order to remove the Node n from the list. [You can use assignments to instance variables and you can call methods of the Node class, but do not call methods of the List ADT itself.]Show transcribed image text