Answer Happy

Need （d）and （e）please.
Consider the relation R= {(1,2), (1, 4), (2, 2), (2,3), (3, 4), (4,1)} whose domain is {1,2,3,4}. (a) Draw a digraph (directed graph) that represents this relation. (b) Write a matrix A that represents the relation R. Label the rows and columns 1, 2, 3, and 4 in that order. (c) Compute the matrix A+ of the transitive closure of the relation. (d) Using your answer to part (c), draw a digraph that represents the transitive closure of R. (e) A walk of length 3 in the original graph of R that starts from vertex 3 can end at which vertices? Explain your answer using the matrix powers you calculated for part (c).