Prove that a tree with a vertex of degree 4 must have at least 4 leaves. hint: any simple graph with a vertex of degree 4 must have at least 5 vertices. you may wish to prove this claim for all trees with at least 5 vertices by induction.

the answer is a

step-by-step explanation:

because if you put 1 in to the square root of x it equals 300.

the awnser is visionary

answer:

at time x=0 we have 1000, at time x=1 we have 2000, at time x=2 we have 4000.  

so that's an initial value of 1000 and a ratio of 2,

y = 1000 (2^x)

hope this !