Draw the UPGMA tree for the distance matrix below (4 pts). 

   0  1   2   3   4   5 
0     3   9  10   9  10
1        10  11  10  11
2             5   6   7
3                 7   8
4                     3
5

Also show intermediate matrices. 

------------------------

Write out the left child, right child, parent, and leaves arrays
for this tree:

                   8
                  / \
                 /   \
                7     \
               / \     \
              5   \     6
             / \   \   / \
            0   1   2 3   4

----------------------

Write a Python function called mindist that returns the minimum
number in a two dimensional matrix. The function definition is

def mindist(D):

Submit a hardcopy on March 28th in class.