The Answer to the Question
is below this banner.
Here's the Solution to this Question
Let us state the steps of the Warshall's algorithm:
Step 1. Let
Step 2. Put
Step 3. For all such that and for all let
Step 4. If then STOP: else go to Step 2.
Consider a relation on the set .
Let us find transitive closure of the relation using Warshall's algorithm:
It follows that is a universal relation on the set