solving algorithm, binary tree etc..

• You may give your algorithms in either java code or pseudo-code. • Please give me the answer of all those questions in PDF file. 1) Draw an arithmetic expression tree that has four external nodes, storing the numbers 1, 5, 6, and 7 (with each number stored in a distinct external node, but not necessarily in this order), and has three internal nodes, each storing an operator from the set { +, –, *, / }, so that the value of the root is 21. Any of these operators may be used more than once, and they are real (not integer) operators, i.e., they may operate on and return fractions 3 more questions will be give to the chosen client!