Consider the method intersection() below, along with two characteristics: public static Set intersection (Set s1, Set s2) / * Oparam s1, s2 : sets to compute intersection of * Oreturn a (non nul1) Set equal to the intersection of Sets s1 and s 2 * Othrows Nul1PointerException if s1 or s2 is null */ Characteristic: Type of s1 = s1 = null - s1 = } s1 has at least one element Characteristic: Relation between s1 and s2 s1 and s2 represent the same set s1 is a subset of s2 s2 is a subset of s1 - s1 and s2 do not have any elements in comon - Does the partition "Type of s1" satisfy the completeness property? If not, give a value for s1 that does not fit in any block. - Does the partition "Type of si" satisfy the disjointness property? If not, give a value for s1 that fits in more than one block. - If necessary, fix "Type of s1N+. - Does the partition "Relation between 81 and 82 " satisfy the completeness property? If not, give a pair of values for 81 and s2 that does not fit in any block. - Does the partition "Relation between 81 and s2" satisfy the disjointness property? If not, give a pair of values for 81 and s2 that fits in more than one block. - If necessary, fix "Relation between s1 and 82