The definition of weighted graph is such that every edge has positive weight. If the def$-$

inition was changed to permit negative $($or zero$)$ weights, would Kruskal's and Dijkstra's

algorithms continue to work? Give a proof or counterexample in each case.