Find the minimum and maximum number of edges that any connected simple bipartite graph with n vertices could have.

roots are from trees

step-by-step explanation:

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