$7.(1$ point$)$ The following function is supposed lo insert a new node into its proper place in an ordered list, returning a pointer to the first node in the modified list. Unfortunately, the function doesn't work correctly in all cases. Explain what's wrong with it and show how to fix it$.$

$```$

struct node $*$insert$\_$into$\_$ordered$\_$list$($struct node $*$list$,$ struct node $*$new$\_$node$)$

$\{$

struct node $*$cur $=$ list, $*$prev $=$ NULL;

while $($cur$->$value new$\_$node$->$value$)\{$

prev $=$ cur;

cur $=$ cur$->$next;

$\}$

prev$->$next $=$ new$\_$node;

$```$

Generated on $11/21/202422$:$05$:$12$ EST

$```$

new$\_$node$->$next $=$ cur;

return list;

$\}$

$```$

$8.(1$ point$)$ Consider the following definition of node:

$```$

struct node $\{$

int value;

struct node $*$next;

$\}$;

$```$

Write the following function: struct node $*$find$\_$last$($struct node $*$list$,$ int n$)$; The list parameter points to a linked list. The function should return a pointer to the last node that contains $\backslash ($ n $\backslash )$; it should return NULL if $\backslash ($ n $\backslash )$ doesn't appear in the list. Write a complete program to check your function. You must submit your complete solution code $(.$c file$).$