Write and test an efficient Java method for splitting a doubly linked list L into two separate doubly linked lists, each containing half of the elements $($if L has an odd number of elements, one list should have one more element than the other$).$ Hint: Add the method to the DoublyLinkedList class and ensure the method runs in linear time.