n fact, Prim$$s algorithm can be implemented in time O$(|$V $|$ log $|$V $|)$ by using a Fibonacci heap.

Following this fact, show an algorithm that solves MST in time complexity O$(|$E$|$ log log $|$V $|)+$

$4$

O$(|$E$|+|$V $|$

log $|$V $|$ log $|$V $|$

log $|$V $|).$