How many unique tree graphs (i. e. with different degree patterns) can be made with 4 vertices?
a) 0
b) 1
c) 2
d) 3

idk i would have to be there to under stand it

step-by-step explanation:

idk i would have to be there to under stand it

part a

x     y

0     8

1     7.5

2     7

3     6.5

4     6

5     5.5  

for every hour i deducted .5 inches from the length of the candle

part b

it is a function because for every x value there is only one y value

part   c

for every x value there is only one y value

x       y

0       8

1       7.6

2       7.2

3       6.8

step-by-step explanation:

jml angle lkj & angle mj = lm

for this case we must apply distributive property to the following expression:

the distributive property states that:

then, when applying the property we have to multiply the -2 for each term within the parenthesis: