Answer Happy

Construct the most parsimonious phylogeny given the character
matrix below. (assume the outgroup taxon has none of the characters
listed in the matrix). The taxon names are A–H, the characters are
numbered 1–10.
Exactly two characters in this data matrix
are not useful for resolving the topology of the tree. (
True or False)
Taxa A, B, and C form a clade. ( True or False)
Taxa F and G are sister taxa in the most parsimonious tree. (
True or False)
1
2
3
4
5
6
7
8
9
10
OG
no
no
no
no
no
no
no
no
no
no
A
no
no
no
no
no
no
YES
YES
YES
no
B
no
no
no
no
no
no
YES
YES
no
no
C
no
no
no
no
no
no
YES
no
no
YES
D
YES
no
no
no
no
no
no
no
no
no
E
YES
YES
no
no
no
no
no
no
no
no
F
YES
YES
YES
YES
YES
no
no
no
no
no
G
YES
YES
YES
YES
no
YES
no
no
no
no
H
YES
YES
YES
no
no
no
no
no
no
no