Please do not copy from other sources, will give rating and comment for correct answer, thank you.

Question 4 (10 Points): Consider a singly linked list of length n. (i) For a given node " M " in this list, in the worst case, what is the number of comparisons needed to find M ? (ii) Let us assume the list is sorted in ascending order (according to the data value of each node). Then, in the worst case, what is the number of comparisons needed to find M ? If we want to add a new node " K " in this list, what is the number of comparisons in the worst case