6. Consider the shortest paths problem in the special case where all edge costs are non-negative integers. Describe a modification of Dijkstra's algorithm that works in time 0(EI + VI-M), where M is the maximum cost of any edge in the graph