So, welcome back. So we've already seen how the union between two relations work. Now, the Intersection is pretty much similar, except that instead of finding the union between the two relations r and s, we find the set of common tuples between r and s. So if we have again, the relation r, the relation s. The idea here is that, let's assume relation r has 10 tuples and s has five tuples. If two of the five tuples are similar to the two of the 10 tuples in r and s, this is the return, this is the final answer return from the intersection operator. So, it returns the common tuples in both r and s. And mathematically speaking, it's similar that as you do, which we going to see later, the set intersection, set difference. We're going to talk about this later on another slide. But the idea is that if you want to list, like this as an example, you want to list all student information. So for the students that are double majoring in computer science and electrical engineering. So, you have the table for that computer science and you have another table of relation for the electrical engineering. And if a student is double majoring, this student will have the same kind of entry in both tables, for both relations. So, finding the intersection between these two tables will find the students that are double majoring, in both computer science and electrical engineering based on the schema we've discussed. Thank you.