Write a merge function in C++ that takes pointers to two sorted lists as arguments and returns a pointer to a merged list. Please explain step by step what is each line for. Thank you!

4. Implement the find() function for a Set STL data structure in C++ that takes an integer x as the parameter and returns true if x is present in the set. Otherwise, returns false.

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…

I need help with this question please, regarding time complexity of BobSort and Sorting Analysis in C++. The question is: What is the advantage of using Merge Sort over Quick Sort?