Consider a concept learning problem where the data D, which concerns ancient Egyptian vases discovered in archeological excavations, is expressed as tuples of five attributes: damaged, color, material, kingdom, markings. Examples are classified as either valuable (+) or not valuable (-), and D consists of the following: Assume that all possible values of each attribute are represented in D above. (a) What is the size of the hypothesis space searched by the candidate elimination algorithm (CEA) using the data D given above? (b) Suppose the CEA has seen examples 1 and 2 only so far. Show its current specific boundary S_2 and general boundary G_2 for the version space. (c) Show S_3 and G_3 after the CEA also sees example 3. (d) Show S_5 and G_5 after the CEA also sees the final two examples 4 and 5