1. Create two linked lists each having ten nodes…..the first list has a pointer called UNO to the first node and the second list has a pointer called DUO to the first node. The lists are to be sorted as you create them. The data in the lists will consist of a last name and age (e.g. madhavi 39)..
Print out each sorted list after you create them…..then delete all nodes from the FIRST list whose age is over 40…and delete all nodes from the second list whose age is under 50. Print out both
Finally..merge the REMAINING nodes from both lists into one list..headed by first. Print out the final list.