What is the functionality of the following code? public void function (Node node) { if (size 0) node; O O head = else { } Node temp, cur; for (cur = head; (temp = cur.getNext ()) !=null; cur cur.setNext (node); } size++; Deleting a node at the end of the list Inserting a node at the end of the list Inserting a node at the beginning of the list Deleting a node at the beginning of the list = temp) { Which of the following statement is "false"? In a linked list, a node can have one or two pointers Creating a linked list requires a continuous memory space to be allocated Blockchain is an application of linked list Creating an array requires a continuous memory space to be allocated