See the question below:

Modify the recursive DFS algorithm on page 84 (provided below) to compute the Newick tree format for T.

Page 84 from textbook (Algorithm Design, Kleinberg):

(Depth-First Search) A phylogenetic tree is a rooted tree with leaves labeled by a set of species that is used by Biologists to represent evolutionary relationships. Consider the following example In this figure, each bifurcation (a "T such as x and y) is a node of a rooted tree The root of the tree is the left-most bifurcation. The leaves are labeled by A, B C, D, and E. Phylogenetic trees are stored as strings in a number of formats In one such format, the Newick tree format, the above tree may be represente