Coding in C++

1 A2 A3 A4 A5 A6 A7 A8 A9 A10 A (In File A)

1 B2 B3 B4 B5 B6 B7 B8 B9 B10 B (In File B)

1. Create a class 'node' which is composed of two members: a letter and a number. 2. Build a singly-linked list by reading from 'fileA A node should be or contain a node object, the implementation is up to you 3. Build a separate linked list by reading from 'fileB 4.Create a recursive print function which prints your lists in the following format: 10A-9A ->8A -1A and then 10B->9B ->8B ->...-> 1B Meaning that your function will print the list in reverse. Note: Your recursive function must not alter the list in any way. 5. Merge the two lists in the following format and then display the full list using the print function you already made: 10A-10B->9A-> 9B-> 8A->8B ->... -> 1A - 1B You may choose to receive 16/20 by only merging the two lists in the following format: 10A->9A->8A->...1A -10B->9B->8B -....>1B