java

Q1 [20 pts) implement your own Doubly Linked List containing n nodes. Each node consists of (int data and two node pointers next and previous) 1. Write and test a Java function to reverse a given Doubly Linked List (a) Original Doubly Linked List pointerU Null (b) Reversed Doubly Linked List Null 2. Write and test a Java function to remove duplicate nodes from the given list 3. Write an algorithm to remove duplicate nodes if the double linked list was sorted. Write and test a Java function to convert the Doubly Linked List to a Doubly Circular Linked List What is the time complexity of each function/algorithm? Q1 [20 pts) implement your own Doubly Linked List containing n nodes. Each node consists of (int data and two node pointers next and previous) 1. Write and test a Java function to reverse a given Doubly Linked List (a) Original Doubly Linked List pointerU Null (b) Reversed Doubly Linked List Null 2. Write and test a Java function to remove duplicate nodes from the given list 3. Write an algorithm to remove duplicate nodes if the double linked list was sorted. Write and test a Java function to convert the Doubly Linked List to a Doubly Circular Linked List What is the time complexity of each function/algorithm