Consider the following database schema with a relation $\textsf{"Likes" :}$
$$\textsf{Likes(kid, candy)}$$
Table Likes tells which candy a kid likes.
Consider the following relational algebra query :
$$\begin{aligned}
&\textsf{H} \leftarrow \Pi_{\textsf{KID}}\left(\sigma_{\textsf{CANDY = "HERSHEYS" }}(\textsf{LIKES})\right)\\
&\textsf{M} \leftarrow \Pi_{\textsf{KID}}\left(\sigma_{\textsf{CANDY = "MARS" }}(\textsf{LIKES})\right)\\
&\textsf{BOTH} \leftarrow \textsf{H UNION M}\\
&\Pi_{\textsf{KID}}(\textsf{BOTH})
\end{aligned}$$
Which of the following is true about the result of the above query?
- The query is to find the kids who like "Hersheys" and "Mars" candy.
- The query is to find the kids who like "Hersheys" candy but not "Mars" candy.
- The query is to find the kids who like "Hersheys" or "Mars" candy.
- The query is to find the kids who like neither "Hersheys" nor "Mars" candy.