Write a simple sequence of instructions that processes two singly linked lists Y and M by removing the first record in Y $($if Y $/=$ Nil$)$ and prepending that record at the front of list M so that M now has this new element as the first record followed by the old M$,$ and Y no longer contains what had been its first record. In other words, you have a list Y$,$ and I have a list M$.$ Present instructions that pull off your head, and place it on top of mine.