Give an algorithm to merge two sorted linked list of integers, using the operations of the IntList abstract data type,

IntList cons(int newElement, IntList oldList) Preconditions: none. Postconditions: Ifx= cons (newElement, oldList), then: 1. x refers to a newly created object 2. x nil; 3. first(x)=nenElement; 4. rest(x)-oldList int first(IntList aList) Preconditions: aList nil. IntList rest(IntList aList) Preconditions: aList nil. IntList nil Constant denoting the empty list