Section B Multiple Choices (10 questions, 2 marks each) Identify the choice that best completes the statement, or answers the question. Enter your answer in the following table 10 2 4 What is the time complexity (Big-Oh) of the following code fragment in terms of the variable n ? 1. int sum 0; for (int = 0; i next = head; - head new node B. headnew_node; new_node->next -head; C. new_node->next = head; head new node; delete new node; D. new_node->next head->next; head = new node