please do in C++

one list. Given two [20 points] Present a function to merge two linked lists and produce lists, your function must merge them in such a way that it interleaves one element from each list alternatively to produce the final list. For example, consider a linked list such as 1--2--3-412->19->NULL with a pointer "first List" pointing to its first element (1), and another list such as 8-->7-->6-->5-->NULL with a pointer secondList" pointing to its first element (8), your function produces 1->8>27-3--6->4>5->12->19-->NULL. with the "frst Pointer" now pointing to the first element of this new list (1). The idea is to merge bo simply append elements from the other list until you have considered all elements th lists by taking one element from each at any time; in case you exhaust one list, you In other words, implement void mergeLinkedList (chunk *firstList, chunk* secondList)