Write a general-purpose tree-drawing program that will convert a tree into the following graph-assembler instructions:
a. Circle(X, Y)
b. DrawLine(i, j)
The ?rst instruction draws a circle at (X, Y), and the second instruction connects the ith circle to the jth circle (circles are numbered in the order drawn). You should either make this a program and de?ne some sort of input language or make this a function that can be called from any program. What is the running time of your routine?