The Answer to the Question
is below this banner.
Here's the Solution to this Question
the transitive closure of a binary relation R on a set X is the smallest relation on X that contains R and is transitive
steps of Warshall’s Algorithm:
Step 1: Execute
Step 2: Execute
Step 3: For all such that , and for all execute the operation
Step 4: If , then stop: the solution is , else go to step 2.
in our case:
k = 1: