I need help with this pls!will give brainliest

Awrestling tournament begins with 128 competitors. in the first round, each competitor has 1 match against another wrestler. the winner of each match moves on to the next round until there is a winner. write a sequence in which the terms represent the number of players still in the tournament at the end of each round. describe the sequence? how many rounds are in the tournament?

Which system of linear inequalities is represented by the graph?

Factor k2 - 17k + 16. a.(k - 2)(k - 8) b.(k - 1)(k + 16) c.(k - 1)(k - 16)