sec randomized algorithms head (ahead (bhead (cfigure illustration of the skip list concept (aa simple linked list (baugmenting the linked list with additional pointers at every other node to find the node with key value we visit the nodes with values and then we move from the node with key value to the one with value (cthe ideal skip listguaranteeing (log nsearch time to find the node with key value we visit nodes in the order then againand finally public find(key searchkey/skiplist search skipnode head/dummy header node for (int =leveli>= --/for each level while (( forward[ !null&/go forward (searchkey compareto( forward[ikey() ) forward[ ]/go one last step forward[ ]/move to actual recordif it exists if (( !null&(searchkey compareto( key()= )return element()/got it else return null/its not there figure implementation for the skip list find function