You are given a number $$n$$ which denotes the number of students in a class. You are given Q

queries and two arrays student$1$ and student$2$ of size Q each. A query can be of $2$ types $-$

$$Friend$,$Total$.$ If the query is $$Friend$,$ then make student$1[$q$]$ and student$2[$q$]$ each other$$s

friends. $$q$$ refers to the serial number of the query, i$.$e$.,$ the index in the queries array. If the

query is of type $$Total$,$ then return the total number of the students in the group of

student$1[$q$]$ and student$2[$q$].$ They both might be in the same group, so you do not need to

count twice in that case