Create two linked lists each having ten nodesA????1..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 BY GPA as you create them. The data in the lists will consist of a last name and GPA (e.g. Smith 3.99).. Print out each sorted list after you create themA????1..then delete all nodes from the FIRST list whose GPA is BELOW 3.0A????1and delete all nodes from the second list whose GPA is ABOVE 2.5. Print out both of these modified lists Finally..merge the REMAINING nodes from both lists into one list..headed by first. Print out the final list. THIS LIST should be created sorted by NAME not by GPA.CAN KNOW SOLUTION IN C++...??