The Answer to the Question
is below this banner.
Here's the Solution to this Question
Let and be the relation on such that
Step 1: put
Step 2: put
Step 3: for all such that and for all put
Step 4: if then STOP else go to the step 2.
Let us find the transitive closure of by Warshall's Algorithm:
It follows that the transitive closure of is the following: