Answer this question in C++

Question III ( 20 minutes-weight: 20%)-Programming: Write a recursive function that updates the value of the nth node in a doubly-linked list. n is a number starting from zero that represents the position of the node. For example, if n is O, it is the first node, if n is 1, it is the second node, and so on. So for example, if you have a list with these values: (1,7,6,2,8,10) and we want to set the value of the fourth node (where n-3) to be 14, the resulting list after the deletion is (1,7,6,14,8,10). Write a wrapper function as well. Assumptions: You can use iterators or manipulate the nodes. front A