Input Format-->On each exercise, your program must accept the input data, from file which its name given in program argument list, plotted as a binary tree in Figure 1, as the following format: 5 4 8 11 - 13 4 7 2 - - - - - 1

hyphen refers to no node. There is one space between each value.

Output Format-->You must write your solution to output file which its name given in program argument list. In first exercise, true or false.

In second exercise; according to given example;

T[0]+T[1]+T[3]+T[8]=22

Run Format-->Your program must be compiled with no error and run as intended, when below commands written in terminal.

$javac Balanced.java

$java Balanced inputfile path outputfile path

$javac Path.java

$java Path inputfile path outputfile path

2. Given a binary tree and a value x, check the given tree has paths that its value is equal to the given value x. The path value is calculated from the values of nodes of the given tree by traversing the tree from root to leaf. If there are paths, write the node positions from root to leaf. I.e: Given the binary tree in Figure 1 and the sum 22, the result should be "true" 5 4 CD 1 / 13 11 4 1 7 2. 1