Problem 1:

A degree-constrained minimum spanning tree is a minimum spanning tree (MST) where the maximum vertex degree is limited to a certain constant k.

The problem is NP-hard. Adapt Prim's and Kruskal's MST algorithms, and implement them, to find degree-constrained MST. Compare the resulting MSTs obtained from these two approximation techniques. Implement in JAVA language