Required information NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Consider the following algorithm: procedure transitive closure (Mr. zero-one nx n matrix) A:= MR B=A for = 2 ton A:= A OMR B:= B vA return B (B is the zero-one matrix for R) Use the given algorithm to find the matrices corresponding to the transitive closures of the following relations on (a, b, c, d, e): {(a, e), (6, a), (b, d), (c,d), (d, a),(d, c), (e, a),(e, b), (e, C. (e, e)) Multiple Choice 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 1 1 1 1 O O O O 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 o ooo 1 1 1 1 1 0 0 0 1 1 1 1 1 1 1. 0 (4) 0 o o o o o o o o o o 0