C++

Write a recursive function called product that takes a pointer to a linked list node (with integer data), and returns the product of the integers in the linked list nodes. You may assume that the list will not be empty. The function prototype is int product (Node * ptr); You can reuse the code that you wrote for Problem 2. Call your recursive function product with the merged linked list and cout the return value. For the example shown in Problem 2, product should return 78750000 (35 * 15 * 30 * 25 * 20 * 10 = 78750000).