$1($Exercise $14\mathrm{.}3-8)$ Let G $=($V$,$ E$)$ be a weighted, directed graph with nonnegaive weight function

w : E $->\{0,1,...,$ W$\}$ for some nonnegative integer W$.$ Modify Dijkstra$$s algorithm to

compute the shortest paths from source vertex s in O$($W $|$V $|+|$E$|)$ time.