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.

An ou structure in your domain has one ou per department, and all the computer and user accounts are in their respective ous. you have configured several gpos defining computer and user policies and linked the gpos to the domain. a group of managers in the marketing department need different policies that differ from those of the rest of the marketing department users and computers, but you don't want to change the top-level ou structure. which of the following gpo processing features are you most likely to use? a, block inheritance b, gpo enforcement c, wmi filtering d, loopback processing