We have students 1, 2, , n who need to be assigned to dormitories at a university that has an arbitrarily large number of dorms. There are m same dormitory requests (s1,t1), (s2,t2), ,(sm,tm) meaning students si and ti must be assigned to the same dorm. There are also k different dormitory requests (u1,v1), (u2,v2),,(uk,vk) meaning students ui and vi must be assigned to different dorms. Give an algorithm using the union-find data structure to determine whether it is possible to assign students to dorms so that all constraints are satisfied.