A graph with n vertices and m edges is dense if m = (n^2). Since Prim's algorithm runs in time O (m log n) time, on dense graphs it runs in O (n^2 log n) time. By not using a min-heap implementation of a priority queue and using a different (and very simple) data structure instead, it is possible to improve the running time of Prim's algorithm to O (n^2) for dense graphs. Describe this data structure and how it is used by Prim's algorithm and then argue that with this new data structure, Prim's algorithm runs in O (n^2) time