Please explain why the answer is what is is thoroughly. I am trying to study for my test. I will make sure to thumbs up! thank you very much for your time

12. The following function is supposed to insert a new node into its proper place in an ordered list, returning a pointer to the first node in the modified list. Which of the following functions will work correctly in all cases? Assume that the node structure is defined as: struct node int value; struct node next a. struct node *insert into ordered list (struct node list, struct node new node struct node *cur list, *prev NULL; while (new node- value cur- value) prev Cur cur cur next new node- next Cur prev next new node return list; struct node insert into ordered list (struct node list struct node *new node) struct node Cur prev for (cur list prev NULL curr NULL 66 new node- value cur value prev Cur cur cur next if (prev NULL) prev next new node new node- next Cur return list; else return new node