c++ or java please

You are working as a development analyst for one of the big media companies, and you need to implement a software program that uses a greedy algorithm in the graphs. 27 14 10 19 31 42 (Tutorials Point, 2018) Step 1: Implement the tree structure above. Step 2: Use any of the following algorithms: Dial Dijkstra Prim Welsh-Powell Step 3: Determine the best possible route that can produce the highest weight from node(7). A greedy algorithm for the graphs should be used to resolve this issue. You need to first implement the tree structure and then implement any algorithm (Dial, Dijkstra, Prim, or Welsh- Powell)