Data Structure and Algorithms

Reverse LL using Recursion

#include #include struct node; typedef struct node Node; struct node int data; Node* next; //declare your function here. int main(int argc, char* argv[]) Node* head = NULL; int i; Node* temp; //set up a test list with values 9->8->7->...->0 for (i 0; i data - i; temp->next - head; head - temp; //call your function to reverse the list (should work for any list given the head node) //print the reversed list. temp = head; while (temp ?= NULL) printf("%d ", temp->data); temp temp->next; return 0; Define your recursive function here (1) Identify and write the base case or cases (2) Recursive condition. (3) write out the code