An aardvark and a zebra are playing a tournament in which black is positive and red is negative. Here are the Aardvark's final scores for the first three games: Aardvark: Game 1 (5 blacks), Game 2 (9 reds), Game 3 (6 blacks). Here are the Zebra's final scores: Game 1 (2 blacks), Game 2 (8 blacks), Game 3 (6 reds). Who has more points after Game 3?

where are the graphs?

step-by-step explanation:

answer: 7. if the functions had a negative leading coefficient and is of even degree, which statement about the graph is true?

step-by-step explanation:

there is only one way to arrange all the eight relative to each other because they are not distinct. we have

now there are nine places to place an (and not more than one in one place).   because we have four symbols, we need to choose four of these nine places to insert an . order does not matter because the are not distinct.

thus there are 1 · c(9,4) ways, or, if we calculate it,

thus there are 126 ways to form such "words."