Divide et Impera is almost optimal for the bounded-hop MST problem on random Euclidean instances 0