c$++$ recursively implement the following with an array of linear linked lists. You must use a public wrapper function to

aid your private recursive function $($i$.$e$.,$ separating repeitive and non$-$reptitive parts of the problem$),$ and do all in as

few traversals as possible. Do not use loops or pointer arithmetic to access the elements of the array, and only

use return type int or bool, no void or node$*.$ Provided code includes struct node with int data and node$*$ next,

and class table, wioth node $****$ head and int size. Output is randomized version of this format: $3156418$

a$.)$ Display the last item in each LLL and return the sum of each

b$.)$ Compare the first node in each LLL and return true if they are the same

c$.)$ Remove the last node in each LLL and return the number of nodes removed

d$.)$ Make a copy of all unique data