void LinkedList::insertAt(int index, int value)
{
	if (index > size)
	{
		return;
	}
	Node* temp = first;
	for (int i=0;i<index-1;i++)
	{
		temp = temp->next;
	}
	Node* newNode = new Node(value);
	newNode->next = temp->next;
	temp->next = newNode;
	temp == nullptr;
	if (index == 0)
	{
		first = newNode;
	}
	if (index == size)
	{
		last = newNode;
	}
	size++;
}