PLEASE HELP Which is the cost of the minimum spanning tree of the weighted graph using Kruskal's Algorithm? 28
30
31
40

apex answer is: true.

2 equivalent expressions to represent the area of a rectangle and the top is n-3 and the side is 2

area of the rectangle = length * width

given length = n - 3

width = 2

replace it in the area

so area of the rectangle = (n-3) *2

= 2(n-3)

one of the expression is 2(n-3)

to get another expression we distribute 2 inside the parenthesis

2(n-3) is 2n - 6

so another expression is 2n - 6

two equivalent expression are

2(n - 3)   , 2n - 6

answer: x=1

step-by-step explanation:

f(x) = g(x)

x - 2 = -1

x = 1

therefore the graph should be a line showing x=1 which is vertical and passes on 1

hope it !