Java please

1. Shortest Paths and Minimum Spanning Trees: In this project you will implement the Dijkstra's shortest path algorithm as well as Prim's minimum spanning tree algorithm (read up about Prim's algorithm). Assume adjacency list representations of the input graphs. Implement the data structure using a binary heap and alternatively, as a linked list, and compare the two methods. You need to be able to incrementally add edges to the graph and update the trees accordingly