Divide and conquer is almost optimal for the bounded-hop MST problem on random Euclidean instances