The The Blocked number is the number 7

Question 2 (4 points) Consider the following function. Assume that the Node class stores references to left and right subtrees, and a reference called data. int baz (Node n){ if (n==null) return 0; int val =0; if (n.right != null) val =n right. data; return val + baz(n.left) + baz(n.right); \} What is returned by function baz ( ) when it is called with a root of the tree shown below? A (Enter a single number as your answer.)