$(3$ points$)$ You can build two different trees with these data. Find the most parsimonious tree.

Characters $C5$ and $C7$ will conflict with $C9.$ They will give different trees. Create the first tree using all characters except $C9.$ Once you have the tree, then add $C9.$ It will have evolved $(01)$ independently at different places in the tree. Next, build a second tree but this time build the tree with $C9$ so it evolved only once. Once you have the second tree, add C$5$ and C$7.$ Draw both trees below and indicate which is most parsimonious.

$\backslash$table$[[,$C$1,$C$2,$C$3,$C$4,$C$5,$C$6,$C$7,$C$8,$C$9],[$OG$,0,0,0,0,0,0,0,0,0],[$A$,1,1,0,0,0,0,0,1,1],[$B$,1,1,0,0,1,1,1,1,1],[$C$,1,1,0,1,1,0,1,1,0],[$D$,1,0,1,0,0,0,0,0,0],[$E$,1,1,0,1,1,0,1,1,0],[$F$,1,0,1,0,0,0,0,0,0],[$G$,1,1,0,0,1,1,1,1,1]]$