Which algorithm will be implemented on the weighted graph in which the edges are uniformly distributed over the half-open interval $[0,1)$ to construct MST so that it runs in linear time?
$A)$ Kruskal's algorithm $B)$ Prim's algorithm
$C)$ Both $(A)$ and $(B)$ $D)$ None of these
