Question 4: Programming 1. Write a recursive function that prints all the odd integers in a linked list in reverse order (from tail to head). Example: If the list has the following numbers: 15 => 24 => 2 => 31, the output should be: 31 15. void PrintReverseOdd (Node *ptr) { } 2. Write a C function without recursion to search for an element (called target) in a Binary Search Tree of characters. All elements in the tree are unique (no duplicates). If found, the function replaces the target by 'F', and then returns 20. If not found, the function returns -20. int FindAndReplace (Node *root, char target) { }