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 i:=2 ton A:= A OMR B:= B V 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, c), (b, d), (C, a),(d, b), (e. d)} Multiple Choice 1 1 0 1 0 0 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 0 1 1 2 1010 0 01010 10100 01010 01010 3 10100 01010 10001 01010 00011 4 00101 01010 10100 10010 01010