Implement an insert member function that places the next node at the end of the list. $($This is different than what I discussed in class$).$

Implement a find member function that finds a specified data element in a linked list.

Implement an insertAfter member function that inserts data after a given data value, such as insertAfter$(2,3)$ where $3$ is inserted after $2.$

Implement a remove$($data$)$ member function that removes a specified data value from a linked list.