Section $10\mathrm{.}2($pp$.159-161)$ provides clues for

# you to use to compose a function called

# drawPhyloTree$($Tree$),$ which will take a tree in

# the form of a tuple as input.

# Recall smallTree from Chap. $9--$

smallTree $=(\text{'}$A$\text{'},$

$(\text{'}$B$\text{'},$

$(\text{'}$D$\text{'},(),()),$

$(\text{'}$E$\text{'},(),())$

$),$

$(\text{'}$C$\text{'},$

$(\text{'}$F$\text{'},(),()),$

$(\text{'}$G$\text{'},(),())$

$)$

$)$

# drawPhyloTree$($tree$)$ should write out the names

# of leaf nodes, but should not write out the

# root or internal nodes.

# Your program should recognize the base case of

# when the tree inhand is actually a leaf node.

# If so$,$ it should write the node's name using

# trutle.write$($x$),$ where x is a string.

# In the recursive case drawPhyloTree$($tree$)$

# should draw branches.