Jaccard Distance

Question

I have this problem in calculating Jaccard Distance for Sets (Bit-Vectors):

p1 = 10111;

p2 = 10011.

Size of intersection = 3; (How could we find it

Answer 1

Size of intersection = 3; (How could we find it out?)

Amount of set bits of p1&p2 = 10011

Size of union = 4, (How could we find it out?)

Amount of set bits of p1|p2 = 10111

Vector here means binary array where i-th bit means does i-th element present in this set.