00:01
In this problem, we're given a set where a is equal to a, b, t.
00:07
The oha contains the elements, a, b, and c.
00:11
And we need to come up with an example of a relation r, such that the symmetric closure of the reflexive closure, of the transitive closure of r, that is not transitive.
00:26
So keep in mind, there are one possible answers to this question.
00:32
So what i'm doing here is just one possible.
00:36
You may do it and get a different answer and also be correct.
00:41
So i will select a value r or the relation r.
00:47
I'm going to set that equal to let r equal the element b, a, c, a.
01:08
And the reason why i chose something of that form is because at the end, we know we do not want it to be transitive.
01:16
So when we do the transitive closure, what we find is that it is equal to our itself.
01:31
So here it is still the same.
01:34
B -a -b -a...