Problem
Write routines makeUnion and intersect that return theunion and intersection of two sorted linked list. (basiclinked list).
Reimplement the standard LinkedList class ( doubly linkedlist)a. With a header but no tailb. With a tail but no headerIn Java.