Suppose we have a pointer to a node in a singly linked list that is guaranteed not to be the last node in the list. We do not have pointers to any other nodes (except by following links). Describe (no need to implement any code, just discuss your analysis for the problem) an o1) algorithm that logically removes the value stored in such a node from the linked list, maintaining the integrity of the linked list. (Hint: Involve the next node and its data). E.g. original list: 1 234 5 After calling remove(node3), the list becomes:145 Why do you think we have the restriction that the node to remove should not be the last Will your algorithm still work if the restriction does not exist