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

a and c

step-by-step explanation:

answer: its c because when it has a magnet next to it it will move away from the mixture. hope this

step-by-step explanation:

6^2 or 36

step-by-step explanation:

6000n

6×1000n

6×10^3 n

so we need 6n need to be a perfect cube

so n has to be 6^2 so that 6n is 6^3

what i'm saying is if you let n be 6^2 you have 6^3×10^3 or 60^3 which is a perfect cube