Discrete Structures, Logic and Computability

Problem 1 Suppose G is the weighted digraph (1, 2, 20), (1, 4, 5), (2,3,10), (3,4, 10), (4, 3,5), (4, 2, 10) where the third element in each tuple is the weight of the edge from the first element to the second element. al Give the weighted adjacency matrix for G. b Compute the shortest paths and shortest distances in G using the algorithms we dis- 1S- cussed. Show your step.s