1, Let G = (V,E) be a directed graph with edge weights w : E R (which may be positive, negative, or zero). Assume there are no negative length cycles in G. (a) How could we delete an arbitrary vertex v from graph G, without changing the Ze an algorithm that constructs a directed graph G, (V', E') with edge weights w' : E' R, where V,-V(v), and the shortest-path distance between any two nodes in G, is equal to between two nodes in G. The algorithm should the shortest- path distance run in O(V2) time