Here's a problem that occurs in automatic program analysis. for a set of variables x1; : : : ; xn, you are given some equality constraints, of the form xi = xj and some disequality constraints,

of the form xi 6= xj . is it possible to satisfy all of them?

for instance, the constraints

x1 = x2; x2 = x3; x3 = x4; x1 6= x4

cannot be satis ed. give an ef cient algorithm that takes as input mconstraints over n variables

and decides whether the constraints can be satisfied.

Okay so for every triangle has three angles that always add up to 180 degrees. and to tell the difference between whether they are secure, right or obtuse is that acute: has one angle that is less than 90 degrees. right triangle means there is at least one angle that is exactly 90 degrees. and an obtuse angle has an angle that is bigger than 180 degrees. i’ll do #13 as an example: 13. 40 and 50 so if every triangle has 180 degrees 40+50= 90 degrees then180-90= 90 degrees so the third angle is 90 degrees and because this triangle has a 90 degree angle it means it is a right triangle

1wthejjebehdn ejdjendnjdnendidne udhejhe djjenejejdjhv95 ag 55wo47wly4wl4uwo46qly4wlu4wly4wtieoyarpyrsou4spu46rsourso64so64so64so64o6raryoaours6oousrosuro6rso6sor6