What is the output of the following code? #include #include struct Node int val; struct Node* next; *head; int min_of_two(int a, int b) if(a next == 0) return temp->val; return min_of_two(temp->val,recursive_get_min(temp->next)); int main() int n = 5, arr[5] =1,1,1,1,1,i; struct Node *temp, *newNode; head = (struct Node*)malloc(sizeof(struct Node)); head -> next =0; temp = head; for(i=0;i next = 0; newNode->val = arr[i]; temp->next =newNode; temp = temp->next; int min_num = recursive_get_min(head->next); printf("%d",min_num); return 0;

Answer: Option A