template bool LinkedList::Merge(LinkedList &list1)

template LinkedList LinkedList::operator+ (const LinkedList &list) const

template LinkedList LinkedList::operator+= (const LinkedList &list)

bool Merge(LinkedList &list1): Takes a sorted list and merges into the calling sorted list (no new memory should be allocated). At termination of function, the list passed in (list1) should be empty (unless it is the calling list). No duplicates are allowed The following operators should be overloaded for the LinkedList. Please make sure signatures are correct on overloads. +,This should add two lists together. The lists are assumed to be sorted and the returned list must also be sorted. Use an efficient sort algorithm and avoid unnecessary data allocations. Duplicates are not allowed and expected. bool Merge(LinkedList &list1): Takes a sorted list and merges into the calling sorted list (no new memory should be allocated). At termination of function, the list passed in (list1) should be empty (unless it is the calling list). No duplicates are allowed The following operators should be overloaded for the LinkedList. Please make sure signatures are correct on overloads. +,This should add two lists together. The lists are assumed to be sorted and the returned list must also be sorted. Use an efficient sort algorithm and avoid unnecessary data allocations. Duplicates are not allowed and expected