Complete the AddToEnd() function

Insert a node that stores the "data" passed in to the very end of the list.

The traversal of the linked list to get to the end has already been written for you.

Edit List.cpp. You will edit List::AddToEnd(int data).
Implement the pointer logic in the section of code labeled "PUT CODE HERE". For example, if the linked list is:
```
  	m_head -> 1 -> 4 -> 5 -> 7 -> 8 -> NULL
```
Lets say you wanted to add 6. current would already be pointing to the 8: your job is to allocate a new Node from the heap, initialize it, and insert it into the list after the 8, so the list looks like this:
```
  	m_head -> 1 -> 4 -> 5 -> 7 -> 8 -> 6 -> NULL
```