The Answer to the Question
is below this banner.
Here's the Solution to this Question
Warshall's algorithm is used to determine the transitive closure of a directed graph or all paths in a directed graph by using the adjacency matrix. For this, it generates a sequence of n matrices. Where, n is used to describe the number of vertices.
Let's apply this method.
Firstly, the matrix of R is given by:
Now R* will be found using the algorithm as follows:
Now, cross product of rows and columns will give:
Matrix of R* is given by:
As (q,b)R* but (p,q)R*, hence R* cannot be equivalence relation.