Add Prim's Algorithm in Java (DSA Folder)

[tiwariar7]

Hi, I'd love to contribute by adding Prim's Algorithm in Java to the DSA folder of the repository. This algorithm is important for finding a minimum spanning tree in a graph, and I believe it will be a valuable addition for anyone looking to strengthen their understanding of graph algorithms.

Proposed Changes:
The algorithm will be implemented in Java and placed inside the DSA/Java folder.
I'll use a priority queue (or an optimal method) to ensure the implementation is efficient and easy to understand.
Why This is Useful:
Adding Prim's Algorithm will help expand the variety of graph algorithms in the repo and serve as a helpful resource for learners who are practicing data structures and algorithms.

Labels:
It would be great if this issue could be labeled as hacktoberfest and enhancement. Thanks!