The following binary relation of the set {a, b, c, d, e} is given:

R = { (a,b), (a,c), (b,c) }

What I have to do is to find the smallest reflexive / symmetric / transitive / antisymmetric relation including R.

I know what these relations are all about, but what I have trouble with is how to find them. For example, I see no reflexive relation in the set. Does "including R" mean that i can extend R with any element from the given set? So for example, if I am looking for a reflexion can I just add (a, a)?

If I can extend the set, my solution would be:

Reflexive: Add (a,a)
Symmetric: Add (b,a)
Transitive: Already satisfied
Antisymmetric: Already satisfied? I am not sure about this one



Question: Patch OpenSSL CVE-2014-0160 on ubuntu 12.04?
Answer: Why don't you update? If Ubuntu says you need 5.12, and that heartbleed site says you're vulnerable, what's the problem? 

I have the following installed, which was updated yesterday or today on my machine. 

ii  openssl                                  1.0.1-4ubuntu5.12