Create a Singly Linked List Class:

o Implement a class for a singly linked list that includes the following methods:

$$ insert$($value$)$: Insert a new node with the specified value at the end of the

list.

$$ delete$($value$)$: Remove the first node containing the specified value.

$$ search$($value$)$: Return the position of the first node containing the

specified value $($or $-1$ if not found$).$

$$ display$()$: Print all elements in the linked list.

$2.$ Test the Implementation:

o Write a main function to test your linked list class. Perform the following:

$$ Insert at least $5$ values into the linked list.

$$ Search for a couple of values $($both present and absent$).$

$$ Delete one value and display the list before and after deletion.

in c$++$