MUST BE WRITTEN IN C PROGRAMMING AND TAKE A SCREENSHOT OF OUTPUT! /************* structs and typedefs *************/ typedef struct node { ElemType val; struct node *next; } NODE; struct list_struct { NODE *front; NODE *back; }; /************* structs and typedefs *************/ /* * returns pointer to newly created empty list */ LIST *lst_create() { LIST *l = malloc(sizeof(LIST)); l->front = NULL; l->back = NULL; return l; } LIST * lst_from_array(ElemType a[], int n) { int i; LIST *lst; lst = lst_create(); for(i=n-1; i>=0; i--) lst_push_front(lst, a[i]); return lst; } /** 

 /** TODO * function: lst_insert_sorted * * description: assumes given list is already in sorted order * and inserts x into the appropriate position * retaining sorted-ness. * Note 1: duplicates are allowed. * * Note 2: if given list not sorted, behavior is undefined/implementation * dependent. We blame the caller. * So... you don't need to check ahead of time if it is sorted. * * DIFFICULTY LEVEL: 2.5 */