Q$6.$ In a linked list implementation of Merge Sort, the linked list needs to be divided recursively from the middle. After dividing, the sublists can then be merged back in a sorted manner. Describe how you would divide the linked list and provide the $C++$ implementation for this process.