Can someone write a c++ algorithm for this: Let be a simple chained list with the following generic definition:

template struct Node {
T data;
Node * next;
};
template struct List {
Node * head;
};
Implement the following generic function, knowing that the order operator for the generic type T exists:

template void mergeSort (List & myList);

The function must stably sort the list into the complexity O (N logN) where N represents the size of the list.