PLease answer ASAP

Write structure of the Singly linked list node which stores an integer value. Consider an ordered singly linked list where the nodes are arranged in the ascending order of their values. Design a function to delete the node with value V from the ordered linked list. The function should consider all the cases such as, the linked list is empty, V is present at various positions in the list, V is not present in the list, etc.. Assume that HEAD points to the first node in the linked list. Only the optimal solution (with least number of operations and memory) will be rewarded. Write structure of the Singly linked list node which stores an integer value. Consider an ordered singly linked list where the nodes are arranged in the ascending order of their values. Design a function to delete the node with value V from the ordered linked list. The function should consider all the cases such as, the linked list is empty, V is present at various positions in the list, V is not present in the list, etc.. Assume that HEAD points to the first node in the linked list. Only the optimal solution (with least number of operations and memory) will be rewarded