97 3 ol 2) 16 pts Consider a special case of the Minimum Spanning Tree problem where the graph G has edge costs of either 1, 3, or 5. We know that we can find an MST in this graph using Prim's algorithm in (m log n) when a binary heap is used as the data structure to hold the nodes (in the set V-S). Given the fact that edge costs can either be l,3, or 5, create a special data structure (replacing the heap) that will improve this t complexity. In other words, the resulting algorithm should performance strictly better than e(m log have a worst-case