. Courier Now - 10-BIVA CAFETIE IEEE - Google Docs * to the document Please use this Google doe during your interview your interviewer will see what you write here). To free your hands for typing, we recommend using a headset or speakerphone. You are given a table representing nodes in a tree. Each row represents a node and has an ID, a parenti and a weight value. For example: id parent weight 10 30 1 30010 20 30 2 40 20 5 The root is the node with a parent ID equal to zero. You can assume that your function will receive a objects with the following structure: Node 1 int i; int parent id Int weight: I... you can add other fields right here necessary Or the equivalent in whatever language you choose to solve the problem You have to print out, for each node, the total weight of a subtree below the node by convention, the weight of a subtree for node X Includes the own weight of X3. Example output 30 - 18 20 = 7 49 5