There is a doubly linked table L. Design an algorithm to findthe node X and swap itwith its successor node.1) Give code.2) Explain the major concept of your algorithm.3) Give an example of runnin 1 answer