Let and be two sorted linked lists (in increasing order). 1. Write a pseudocode that merges the two linked lists into a sorted linked list (that contains the union of their elements). 2. Provide pseudocode to deal with the following situation: the first element of l is not the minimal one in the list (all other elements are in increasing order).