Design a list searching algorithm that incorporates a sentinel (A refinement to the current search algorithm would involve using a sentinel to bring about termination of the search when the search name was beyond the end of the list. This would involve linking the last node to the sentinel which can be set equal to the search name. When this is done the test: (current < > nil) can be dropped and replaced by a single test outside the loop to establish whether the name or the sentinel has been found.).