Assume that you have the following directed graph. Find the transitive closure of the graph using the algorithm covered in the class. In other words, you have to present R(, R(), R2', RG, R(a), and R5) to solve the problem. For your understanding, R( is presented below as an example. Thus, you should present the R("), R(2), R3), R(4) 3 R(0) 12345 21011 1 3 0 0 010 40 000 0 5 0 001 0