Given the fоllоwing tree аnd sequences аt the leаves, find a pоssible set of sequences for nodes 1, 2, and 3 with minimum parsimony score. Break ties in alphabetical order. Show all your work and report the parsimony score. If you choose to write on a piece of paper as opposed to typing in your work, hold the paper up to the camera, pause, move it a little closer and then a little further away, and pause each time. Canvas has a timer, so please note the time of the exam you hold up your answer so I know when in the proctor video to look for your solution. 1. Image Description The tree starts from a root node (1) and branches into two main subgroups (2 and 3). Node 2 further divides into two sequences: ACGT and ATGC. Node 3 splits into two identical sequences: TCGA and TCGA.