Please help my with this function. T m_data; // Data to be stored LLNode<T>* m_next; // Pointer to the next element in the list LLNode<T>* m_head; // Pointer to the first element int m_size; // The number of elements in the list // Purpose: Removes duplicates from a Linked List. // Postconditions: all duplicate elements are removed from the list. // the first occurrence of an element is kept. template <class T> void LinkedList<T>::purge();.

1. Please help my with this function.
T m_data; // Data to be stored
LLNode<T>* m_next; // Pointer to the next element in the list
LLNode<T>* m_head; // Pointer to the first element
int m_size; // The number of elements in the list
// Purpose: Removes duplicates from a Linked List.
// Postconditions: all duplicate elements are removed from the list.
// the first occurrence of an element is kept.
template <class T>
void LinkedList<T>::purge();