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

i believe 28

Step-by-step explanation:

see attached

step-by-step explanation:

given the function as;

write the equation replacing f(x) with y

form   and fill a table containing values of y with corresponding values of x

you can take a range for   values of x as -3≤x≤3

solving for x=-3

for x=-2

repeat the same procedure to get the values of y for the remaining ,x=-1 to x=3

plot the values of y against values   of x and obtain the following graph

i think the length is 12 and the width is 17