Deleting a node in a linked list means deleting the node at that address and not deleting the contents of the node. Read the following statements and enter the number of statements that are false.
1
A node in a singly linked list can be deleted in O(1) if the pointer to the node is given.
2
A node in a singly linked list can be deleted in O(1) if a pointer to the previous node is given.
3
A node in a doubly linked list cannot be deleted in O(1) if pointer to the node is given.
4
A node in a doubly linked list can be deleted in O(1) if pointer to the next node is given.