#1 Assume we have a single-linked char list that is terminated with a null address. Write a recursive function to get the last char value in the list. The drawing and given code should help Implement char SinglyLinkedList: :getTail (Node* ptr); NULL head struct Node char data; Node* next; char SinglyLinkedList::getTail() 1 return getTail (head); char SinglyLinkedList::getTail Node* ptr) f 1I YOUR CODE GOES HERE