A. Write a JAVA swap method to swap two nodes x and y (and not just their contents) in a singly linked list L given references only to x and y. Submit a full running program including the main method testing you swap method.

B. Repeat this exercise for the case when L is a doubly linked list. Submit a full running program including the main method testing you swap method.

C. Which algorithm takes more time? Justify your answer