Which statements are true about the graphs of all nth degree polynomials? choose all that apply. 1) it must go up and down a total of n times. 2) it goes up and down at most a total of n times. 3) the number of x-intercepts is n. 4) the number of x-intercepts is at most n. 5) the end of the graph must go up either to the left or the right. 6) the end behavior depends on the number of terms of the polynomial.

We are given

nth degree polynomial

so, we will verify each options

option-1:

this is FALSE

Because for

It goes up only once

while

goes up and down twice

option-2:

Since, the degree of polynomial is n

so, the maximum number of times it can go up and down as n times

so, this is TRUE

option-3:

this is FALSE

For example:

there is only one x-intercept

while degree is 5

option-4:

since, the degree of polynomial =n

so, the maximum number of x-intercepts =n

so, this is TRUE

option-5:

this is FALSE

For example:

both ends go up

option-6:

this is FALSE

because end behavior of any polynomial always depend on degree and leading coefficients

2) It goes up and down at most a total of n times.

4) The number of x-intercepts is at most n.

please give me brainliest!

Step-by-step explanation:

answer:

c. the third graph