Answer:
The character data are mapped onto each tree in the most parsimonious way possible, but one of the trees is clearly more parsimonious than the others. Tree 1 requires just two changes in characters to account for the data, while Trees 2 and 3 require three changes to account for the data.
