What is the output of the following code? #include #include struct Node int val; struct Node *next; *head; int recursive_get_len(struct Node *current_node) if(current_node == 0) return 0; return 1 + recursive_get_len(current_node->next); int main() int arr[10] = -1,2,3,-3,4,5, n = 6, i; struct Node *temp, *newNode; head = (struct Node*)malloc(sizeof(struct Node)); head->next = 0; temp = head; for(i=0; i val = arr[i]; newNode->next = 0; temp->next = newNode; temp = temp->next; int len = recursive_get_len(head->next); printf("%d",len); return 0;

Answer: Option B