let t be an arbitrary tree with maximum degree 3. what is the relationship between the number of vertices of degree 1 and the number of vertices of degree 3 in t? prove your answer using the handshaking lemma.
(c) generalise the result for an arbitrary tree, by proving a formula for the number of vertices of degree 1 in terms of the number of vertices of degree d (for d = 3, 4, 5, .

a. 74 degrees

step-by-step explanation:

because the lines through the side and the box in the corners shows that these are congruent triangles and since they are mirrored the 37 degrees is also mirrored so the answer is 37 * 2 which is 74.

correct answer is infinitely many solutions

step-by-step explanation:

2(2x + 3) = -4 + 2(2x + 5)

solving the above equation:

4x + 6 = -4 +4x +10

combining like terms

4x -4x = -4+10-6

0=0

since both sides are 0=0, we end up into true statement it means it has infinite many solutions.

so correct answer is infinitely many solutions

c-   36

taxicab circle radius 9 has 4(9) = 36 points

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 !