$1.(50$ points$)$ Input Space Partitioning

Answer the following questions for the method intersection$()$ below:

public Set intersection $($Set s$1,$ Set s$2)$

$//$ Effects: If s$1$ or s$2$ is null, throw NullPointerException

$//$ else return a $($non null$)$ Set equal to the intersection of Sets s$1$ and s$2$

Characteristic: Size of s$2$

$-$ s$2$ has even number of elements $($in other words, the size of s$2$ is an even number$)$

$-$ s$2$ has odd number of elements $($in other words, the size of s$2$ is an odd number$)$

Characteristic: Relation between s$1$ and s$2$

$-$ the size of s$1$ is not bigger than the size of s$2$

$-$ the size of s$2$ is not bigger than the size of s$1$

$($a$)$ Does the partition "Size of s$2"$ satisfy the completeness property? If not, give a value for s$2$

that does not fit in any block.

$($b$)$ Does the partition "Size of s$2"$ satisfy the disjointness property? If not, give a value for s$2$

that fits in more than one block.

$($c$)$ Does the partition "Relation between s$1$ and s$2"$ satisfy the completeness property? If not,

give a pair of values for s$1$ and s$2$ that does not fit in any block.

$($d$)$ Does the partition "Relation between s$1$ and s$2"$ satisfy the disjointness property? If not,

give a pair of values for s$1$ and s$2$ that fits in more than one block.

$($e$)$ If the "Base Choice" criterion were applied to the two partitions $($exactly as written$),$ how

many test requirements would result?