give the output of printexpression(tt root()(code fragment - describein pseudo-codean algorithm for computing the number of descendents of each node of binary tree the algorithm should be based on the euler tour traversal - let be (possibly improperbinary tree with nodesand let be the sum of the depths of all the external nodes of show that if has the minimum number of external nodes possiblethen is (nand if has the maximum number of external nodes possiblethen is ( log nr- let be binary tree with nodesand let be the level numbering of the nodes of tas given in section show thatfor every node of tp( < show an example of binary tree with seven nodes that attains the above upper bound on (vfor some node - show how to use the euler tour traversal to compute the level numberdefined in section of each node in binary tree - draw the binary tree representation of the following arithmetic expression"((( ( ))/(( (( ) ) - let be binary tree with nodes that is realized with an array listsand let be the level numbering of the nodes in tas given in section give pseudo-code descriptions of each of the methods rootparentleftrighthaslefthasrightisinternalisexternaland isroot