Hello. I am asking that all the work is shown on paper. I know the final answer is a 4 x 4 matrix containing all 1s. I'm just not getting that result. I have enclosed an example problem from the textbook that basically shows what I need to do. I'm having a hard time finding M2r, M3r, and M4r. Please show the work on how you get those. Help would be appreciated. THEOREM 3Let MR be the zero-one matrix of the relation R on a set with n elements. Then the zero-onematrix of the transitive closure R* isMR* = MR V MR¹V MR¹v...v MR¹.EXAMPLE 7 Find the zero-one matrix of the transitive closure of the relation R where1 0 1MR 01 00=Solution: By Theorem 3, it follows that the zero-one matrix of R* is[3]MR* = MR V MR¹V MR¹BecauseM²1=it follows thatMR*=andMB1100 1 0 0 1 0=09.4 Closures of Relations 603V0 1 0 = 0101 25. Use Algorithm 1 to find the transitive closures of theserelations on {1, 2, 3, 4].a) {(1, 2), (2, 1), (2, 3), (3, 4), (4,1)}

Answered: Image /qna-images/answer/348c3be7-bd88-4a09-b777-912fc666cff0.jpg

Answered: 25. Use Algorithm 1 to find the…

Elementary Linear Algebra (MindTap Course List)

8th Edition

ISBN:9781305658004

Author:Ron Larson

Publisher:Ron Larson

Chapter5: Inner Product Spaces

Section5.CM: Cumulative Review

Problem 11CM

See similar textbooks

Related questions

Question

Hello. I am asking that all the work is shown on paper. I know the final answer is a 4 x 4 matrix containing all 1s. I'm just not getting that result. I have enclosed an example problem from the textbook that basically shows what I need to do. I'm having a hard time finding M²_r, M³_r, and M⁴_r. Please show the work on how you get those. Help would be appreciated.