Create two SORTED 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 nodes in each list contain two fields: LASTNAME and GPA
Print out each sorted list after you create them…..then delete all nodes from the FIRST list whose GPA is above 3.0…and delete all nodes from the second list whose GPA is under 2.0. Print out both of these modified lists
Finally..merge the REMAINING nodes from both lists into one list..headed by first BUT SORTED by LAST NAME. Print out the final list.