Question $1$: Concept Learning

The data in Table $1$ show the content rating $(S,N,V,L)$ of $6$ different movies, labeled

$m_1$ to $m_6,$ and whether Jane liked the movie, or not.

Table $1$: Jane's movie preferences

We want to use the data in Table $1$ to learn which kind of movies, based on their

content rating, Jane likes to watch. A hypothesis for this data set can be written as

a conjunction of literals, for example:

$h_1=S^{{?}^{?}}not{N}^{{?}^{?}}$notV

$($a$)$ Use the Candidate$-$Elimination algorithm to find the $G-$ and $S-$boundaries of

the data in the table. Show all your steps.

$($b$)$ What do you observe about the resulting version space that you computed

above?

$($c$)$ Order the following hypotheses from least specific to most specific:

i$.h_1=V$

ii$.h_2=N^{{?}^{?}}$notV

iii. $h_3=$notN