Let x1,x2,,xn be variables in a program. Some of these variables have to be equal; some have to be different. These conditions are specified by constraints of the form xi=xj or xi=xj. For example, x1=x3,x3=x4,x3=x5,x2=x4 is a set of constraints that can be satisfied. On the other hand, x1=x2,x2=x3,x3=x4,x4=x1 cannot be satisfied. Given n variables and m constraints, design an efficient algorithm that outputs 'yes' if the set of constraints can be satisfied and 'no' otherwise. Briefly explain why your algorithm is correct and determine the running time of your algorithm