Provide a modification of Dijkstras algorithm for the case that the range of the weight function c equals { 1 , 2 , 3 , . . . , k } for some k N . Your algorithm must have a worst-case running time of O ( k | V | + | E | ). Explain the correctness of your modified algorithm and its running time.