A common way of thinking about linked list Node objects is that each Node contains a head value and a pointer containing another list. Write a function to calculate the length of a linked list using this approach. Your method should accept a pointer to a Node object and recurse through the list until you reach the end. The function should then return the length of the linked list. Writer a driver function that tests this meaning an int main.