[solved]-Write Function Merges Two Sorted Array Based Lists One Sorted Array Based List Function Ta Q39060512

Write a function that merges two sorted array-based lists intoone sorted array-based list. The function takes two arrays asparameters, each holding a sorted list of integers, merges theminto a single sorted list, and returns theresult.  Note that this function performs themerge part of the merge sort algorithm.

The function should have a linear time complexity i.e.O(N), where N is the sum of the length of the two input lists itmerges. Note: function that not linear will not get anycredit.

Deliverables:

• A copy of your merge function code in a text file
• A copy of a test program to test your function. (Be sure totest all cases e.g. two empty lists, one empty only, lists with 1element each, lists with multiple elements)
• Screenshots of your test runs showing your function meetsspecifications.

please write in c++

Expert Answer

---

Answer to Write a function that merges two sorted array-based lists into one sorted array-based list. The function takes two arra… . . .