This is in c++instructions: for a linked (singly linked) list, a node can be defined as (see page 1086ff in text book): struct nodetype{ int info; // this can be any data type even another structure. nodetype *link; // link to next node.}; the variable declaration for nodetype is: nodetype *head; to support the node struct, create functions to operate on nodes such asdelete() and so on using struct rather than classes. for example, the create() function should accept input continuously as long as the user indicates there is more input and the display() function should display all of the items in the linked list. add functions as needed to support the merge operation as explained below. finally, add a function called merge() which takes two ordered link lists (lista and listb) and merges them into a single merged link list (listx). the two original ordered link lists (lista and listb) at the end of the merge will be empty. the merged link list (listx) will initially be empty and at the end will contain the merged list. your program should input the first ordered link list (lista) and the second ordered link list (listb). the program should display the first ordered link list (lista), the second ordered link list (listb), perform the merge and then display the merged link list (listx).supply the program source code, two sets of input data and two sets of corresponding sets of output as text file of characters declared as chars. first set of data should be the example below and second set should be a set you created. example: lista: a b c i j k l m q r x y zlistb: d e f p s tlistx (merged file): a b c d e f i j k l m p q r s t x y z