Given two $($possibly eRemove the first n nodes from a $($possible empty$)$ linked list.

Note: $0<=$ n $<=$ lst$.$length$()$

Example: Given an linked list $1->2->3->4->5$ and n $=3,$ return the linked list $4->5.$mpty$)$ linked lists, concatenate them such that the first list comes first.

Example: When the first input linked list lst$1$ is $1->2->3$ and the second lst$2$ is $7->8->9,$ the output

linked list is $1->2->3->7->8->9.$