Please show you got the answers.

16. Let R (z,z+1) l z E Z). Find appropriate names for each of the following relations. b. rt(R). Path Problems 17. Suppose G is the following weighted digraph, where the triple (i j, d) repo- resents edge (i, j) with distance d: ((1, 2, 20), (1, 4, 5), (2, 3, 10), (3, 4, 10), (4, 3, 5), (4, 2, 10). b. Use (4.1.9) to compute the two matrices representing the shortest dis tances and the shortest paths in G