Concept Learning
(a) Write an algorithm called \Find-G" to nd a maximally-general consistent hypothesis. You can assume the data will be noise-free and that the target concept is in the hypothesis space.
(b) Outline the steps in a proof that Find-G will never fail to cover a positive example in the training set.