Part I. Write a Python program that takes a distance matrix as input from a file matrix.txt and outputs the P, L, R, and leaves lists of the UPGMA tree (10 pts). HOW TO SUBMIT YOUR ASSIGNMENT: Copy your solution to your course directory /afs/cad/courses/bnfo/s17/bnfo/236/002/ Use the Unix command cp .py /afs/cad/courses/bnfo/s17/bnfo/236/002// Alternatively open your H drive from any Windows machine on campus and copy your solutions there into the directory link called s17.bnfo236.002. ------------------------ Part II Modify the distance function in your code to return the maximum instead of the average distance between two nodes in the tree. (10 pts) Hint: change the summation and average into a determination of the maximum Submit solution of Part II in writing in class. ------------------------- Both parts are due April 11th, 2017, 11:30am