**Before this program was posted in 2 parts, I am done with the first one but I think I still need some help for the second part. When you download the zip file, please disregard all the files associated with project I.
Part II:**Grouping things into binary tree structure is a common problem in many fields. The general graph produced by this algorithm is called a dendrogram. During each iteration, the program finds the two nodes whose values are closest and cluster them (UPGMA algorithm). A new label is produced that represents the pairing of the two constituent labels and also forms the basis for standard Newick format output. This looping is complete when only one label remains, representing the Newick form of the tree structure. Write a program, which will produce a phylogenetics tree based on the values in the distance matrix. Your program should show that by changing the values in the distance matrix, different final structures are produced. The output should be in Newick format.
A running program.