write general-purpose tree-drawing program that will convert tree into the following graph-assembler instructionsa circle(xyb drawline(ijthe first instruction draws circle at (xy)and the second instruction connects the ith circle to the jth circle (circles are numbered in the order drawnyou should either make this program and define some sort of input language or make this function that can be called from any program what is the running time of your routine write routine to list out the nodes of binary tree in level-order list the rootthen nodes at depth followed by nodes at depth and so on you must do this in linear time prove your time bound write routine to perform insertion into -tree write routine to perform deletion from -tree when an item is deletedis it necessary to update information in the internal nodesc modify your insertion routine so that if an attempt is made to add into node that already has entriesa search is performed for sibling with less than children before the node is split -tree of order is -tree in which each interior node has between / and children describe method to perform insertion into -tree show how the tree in figure is represented using child/sibling link implementation write procedure to traverse tree stored with child/sibling links two binary trees are similar if they are both empty or both nonempty and have similar left and right subtrees write function to decide whether two binary trees are similar what is the running time of your functiontwo treest and are isomorphic if can be transformed into by swapping left and right children of (some of thenodes in for instancethe two trees in figure are isomorphic because they are the same if the children of aband gbut not the other nodesare swapped give polynomial time algorithm to decide if two trees are isomorphic figure tree for exercise