Write this function given the template below for linked lists in C++ with the given requirements:

Given implementation of Linked list that can be helpful for writing function:

QUESTION: Function: concatsort assumes both list a and b are in SOrted (non-descending) order and merges them into a single sorted list with the same * elements This single sorted list is stored in a while b becomes empty. if either of given lists are not sorted, implementation dependent - i.e., don't worry * we blame the caller and the behavior is about it! Condition in which both parameters are the same list (not merely "equal"), the function simply does nothing and returns. This can be tested with simple pointer comparison Example: a: [2 3 4 9 10 30] b: [5 8811 20 40] after call a.merge with (b): a: [2 3 45 889 10 11 20 30 40] REQUIREMENTS : Runtime Must be linear in the length of the resulting merged list (or using variables above, O (a.length () +b.length should not allocate ANY new list nodes - it should just re-link existing x nodes. Cannot change function parameters void merge_with (List &other)