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. 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, node $*$ next, node $*$ previous and class list.

Output is randomized version of this format: $3->15->6->27->41->8->33->2->2$

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

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

c$.)$ Remove the first node in each LLL and return sum of each

d$.)$ Display all of the data in the last LLL and return the largest nl$\_$item