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 (Mri zero-one nx n matrix) A:=MR B= A for i= 2 to n A:= A OMR B= B v A 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, b),(a, c),(a, e), (b, a),(b, c), (c, a),(C, b), (d, a),(e, d)} Multiple Choice 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 1 1 1 1 0 0 0 0 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 1 1 1 1 1 o o o 1 1 1 1 1 1 o o o o 1 To o o o o | o o o o o