Consider the implementation of a tree where each node can have arbitrary many children. In the data structure used for storing the tree the children of a given node are organized in a singly linked list using the sibling field and the parent has firstchild field. Nodes are storing integer values. The declaration of the Node class for this tree is as follows: class Node C int data; Node finstchild; Node sibling; What is returned by the following function when it is called with a reference to the node marked with a circle in the tree shown above? Int bar( Node n) ( If(nunu11) return ; Node cur = n; int a = 0; while (cur i= nu11) f a - cur.data; cur = cur.sibling; return a