Programming in c++ Write a client function that merges two instances of the Sorted list ADT using the following specification: Function: Merge two sorted lists into a third sorted list. Precoditions: list1 and list2 have been initialized and are sorted by key using function ComparedTo; list1 and list2 do not have any keys in common. Postconditions: result is a sorted list that contains all of the items from list1 and list2. a. Write the prototype for MergeLists. c. Write the function definition, using a linked implementation. d. Describe the algorithm in terms of Big-O.

Write in C Language Description Please finish the following function char *replace(charsource, char constpattern, char constreplacement) A sequence of calls to this function replace the pattern with replacement. On a first call, the function expects a C string as argument for source, and this function scan for source to find the first pattern appear in source than replace it with replacement. In subsequent calls, the function expects a null pointer and uses the position right after the end of the last replacement as the new starting location for scanning. This function return source. Please see following example. char source[100] = "1223456789", pattern[10] = "2", replacement[10] = "123"; printf("%s", replace(source, pattern, replacement)); //Here should print out 112323456789 printf("%s", replace(source, pattern, replacement)); //Here should print out 11123323456789 printf("%s", replace(NULL, pattern, replacement)); //Here should print out 1112331233456789   function char…

Don't use AI and chatGpt!!!!!!!!

Write a user defined function named as “length_list” function that finds the length of a list of list_node_t nodes. This code should fit with the following code.Partial Code: #include <stdio.h> #include <stdlib.h> /* gives access to malloc */ #define SENT -1 typedef struct list_node_s { int digit; struct list_node_s *restp; } list_node_t; list_node_t *get_list(void); int main(void) { list_node_t *x;int y; x=get_list(); printf("%d\n",x->digit); printf("%d\n",x->restp->digit); printf("%d\n",x->restp->restp->digit); // your length_list function should be called from here printf("Length is: %d",y); } /* * Forms a linked list of an input list of integers * terminated by SENT */ list_node_t * get_list(void) { int data; list_node_t *ansp; [20]scanf("%d", &data); if (data == SENT) { ansp = NULL; } else { ansp = (list_node_t *)malloc(sizeof (list_node_t)); ansp->digit = data; ansp->restp = get_list(); } return (ansp);