Can you Please Correctly Solve this Problem for me, Thanks! Use Java (preferably NetBeans) to solve the following Minimum Spanning Tree Problem: You need to apply Prim's algorithm to a given weighted undirected graph to determine the minimum spanning tree in the graph. Input: Multiple test cases will be used to evaluate your program. Each test case starts with two integers, n and e, which stand for the vertices and edges respectively. The next e lines show the vertices that are connected by an edge and the weight of that edge. Output: For the test cases, the output should print the sum of weights on the edges of the minimum spanning tree, along with the corresponding edges' weights. Example: Note: Use Scanner Method so I can test different Sample Inputs. Also provide the code in proper format and comments that I can copy and understand properly. Please show output as well