Consider a singly linked list where each node contains two fields – integer data and node type pointer next. The head of the list and a value of the data is given. You have to find the node that...

Consider a singly linked list where each node contains two fields – integer
data and node type pointer next. The head of the list and a value of the data is
given. You have to find the node that contains the given data and delete that
node. Data may occur at any position of the list including first or last. In case
of unavailability of the given data, you have to print a message. You have to
Implement a delete operation of a singly linked list.