What is the time complexity of the following iterative code used to find the smallest and largest element in a linked list? #include #include struct Node int val; struct Node* next; *head; int get_max() struct Node* temp = head->next; int max_num = temp->val; while(temp != 0) if(temp->val > max_num) max_num = temp->val; temp = temp->next; return max_num; int get_min() struct Node* temp = head->next; int min_num = temp->val; while(temp != 0) if(temp->val val; temp = temp->next; return min_num; int main() int i, n = 9, arr[9] =8,3,3,4,5,2,5,6,7; 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 max_num = get_max(); int min_num = get_min(); printf("%d %d",max_num,min_num); return 0;

Answer: Option B