Consider the following network: V3 Figure: Problem 4. with the edge weighting defined by w(ve. V2) = w(0%, ve) =l- log,(k), l < k. (a) Compute w(v1, e3), w(15, v4) and w(, va4). (b) Write down all the weights w(e) on the edge e accordingly. (c) Find the shortest routing paths from the source node vz to every other nodes in V using the Dijsktra's algorithm. Show all your steps.