void LinkedList::AddToEnd(int value) // this adds nodes to the back of the list.
{
	int count = 1;
	Node* newNode = new Node();
	newNode->data = value;
	newNode->p_nextNode = nullptr;

	if (mp_startingNode == nullptr)
	{
		newNode->index = count;
		mp_startingNode = newNode;
		return;
	}
	Node* currentNode = mp_startingNode;
	count++;
	// LOOP THROUGH LIST
	while (currentNode->p_nextNode != nullptr)
	{
		count++;
		currentNode = currentNode->p_nextNode;
	}
	newNode->index = count;
	currentNode->p_nextNode = newNode;
}